On lexicographic representatives in braid monoids

The language of maximal lexicographic representatives of elements in the positive braid monoid A n with n generators is a regular language. We describe with great detail the smallest finite-state automaton accepting such language and study the proportion of elements of length k whose maximal lexicog...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of algebraic combinatorics 2020-12, Vol.52 (4), p.561-597
Hauptverfasser:	Flores, Ramón, González-Meneses, Juan
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Braiding Combinatorics Computer Science Convex and Discrete Geometry Fibonacci numbers Finishes Group Theory and Generalizations Lattices Mathematics Mathematics and Statistics Monoids Order Ordered Algebraic Structures
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!