Lyndon heaps: An analogue of Lyndon words in free partially commutative monoids

DOI10.1016/0012-365X(94)00032-EzbMath0831.68079MaRDI QIDQ1901039

Pierre Lalonde

Publication date: 29 October 1995

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Lyndon heaps

Mathematics Subject Classification ID

Combinatorics on words (68R15) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items

Generalised chromatic polynomials of graphs from heaps of pieces, A study on free roots of Borcherds-Kac-Moody Lie superalgebras, Lyndon bases of free partially commutative Lie algebras, On Dynkin and Klyachko idempotents in graded bialgebras

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lyndon bases of free partially commutative Lie algebras
• Some properties of commutation in free partially commutative monoids
• On some equations in free partially commutative monoids
• Theory of traces
• The free partially commutative Lie algebra: Bases and ranks
• Combinatorial problems of commutation and rearrangements
• Factorizing words over an ordered alphabet
• On Burnside's Problem
• Free differential calculus. IV: The quotient groups of the lower central series
• Inhomogeneous sorting