Related papers: Coherence for plactic monoids via rewriting theory…
The vertices of any (combinatorial) Kashiwara crystal graph carry a natural monoid structure given by identifying words labelling vertices that appear in the same position of isomorphic components of the crystal. Working on a purely…
We construct finite coherent presentations of plactic monoids of type A. Such coherent presentations express a system of generators and relations for the monoid extended in a coherent way to give a family of generators of the relations…
In this article we introduce the $\mathbb{N}-$decorated plactic monoid of type $C$, denoted $Pl^\mathbb{N}(C_n)$, via a finite convergent presentation $ACol$, with generating set $ACol(C_n)$ consisting of admissible columns, and an element…
A coherent presentation of an n-category is a presentation by generators, relations and relations among relations. Confluent and terminating rewriting systems generate coherent presentations, whose relations among relations are defined by…
String rewriting systems have proved very useful to study monoids. In good cases, they give finite presentations of monoids, allowing computations on those and their manipulation by a computer. Even better, when the presentation is…
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even better, when the presentation is confluent and terminating,…
A series of works has established rewriting as an essential tool in order to prove coherence properties of algebraic structures, such as MacLane's coherence theorem for monoidal categories, based on the observation that, under reasonable…
Crystal bases are powerful combinatorial tools in the representation theory of quantum groups $U_q(\mathfrak{g})$ for a symmetrizable Kac-Moody algebras $\mathfrak{g}$. The polyhedral realizations are combinatorial descriptions of the…
We study rewriting properties of the column presentation of plactic monoid for any semisimple Lie algebra such as termination and confluence. Littelmann described this presentation using L-S paths generators. Thanks to the shapes of…
We study the four plactic-like monoids that arise by taking the meets and joins of stalactic and taiga congruences. We obtain the combinatorial objects associated with the meet monoids, establishing Robinson-Schensted-like correspondences…
The hypoplactic monoid was introduced by Krob and Thibon through a presentation and through quasi-ribbon tableaux and an insertion algorithm. Just as Kashiwara crystals enriched the structure of the plactic monoid and allowed its…
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…
We consider a generalization of the quiver varieties of Lusztig and Nakajima to the case of all symmetrizable Kac-Moody Lie algebras. To deal with the non-simply laced case one considers admissible automorphisms of a quiver and the…
We compute coherent presentations of Artin monoids, that is presentations by generators, relations, and relations between the relations. For that, we use methods of higher-dimensional rewriting that extend Squier's and Knuth-Bendix's…
Higher-dimensional rewriting systems are tools to analyse the structure of formally reducing terms to normal forms, as well as comparing the different reduction paths that lead to those normal forms. This higher structure can be captured by…
Convergent rewriting systems are well-known tools in the study of the word-rewriting problem. In particular, a presentation of a monoid by a finite convergent rewriting system gives an algorithm to decide the word problem for this monoid.…
Convergent rewriting systems on algebraic structures give methods to solve decision problems, to prove coherence results, and to compute homological invariants. These methods are based on higher-dimensional extensions of the critical…
We describe a formalism, using groupoids, for the study of rewriting for presentations of inverse monoids, that is based on the Squier complex construction for monoid presentations. We introduce the class of pseudoregular groupoids, an…
Structure monoids and groups are algebraic invariants of equational varieties. We show how to construct presentations of these objects from coherent categorifications of equational varieties, generalising several results of Dehornoy. We…
We study the confluence property of abstract rewriting systems internal to cubical categories. We introduce cubical contractions, a higher-dimensional generalisation of reductions to normal forms, and employ them to construct cubical…