Decreasing diagrams and coherent presentations
classification
🧮 math.CT
math.RT
keywords
relationscoherentdecreasingdiagramspresentationsigmatheoryapply
read the original abstract
We show how decreasing diagrams introduced in the theory of rewriting systems can be used to prove coherence type theorems in category theory. We apply this method to describe a coherent presentation of the $0$-Hecke monoid $\mathcal{H}(\Sigma_n)$ of the symmetric group $\Sigma_n$, i.e. a presentation by generators, relations, and relations between relations.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.