Hostname: page-component-77c78cf97d-lmk9j Total loading time: 0 Render date: 2026-04-28T02:25:15.935Z Has data issue: false hasContentIssue false
  • English
  • Français

Lyndon Words, Free Algebras and Shuffles

Published online by Cambridge University Press:  20 November 2018

Guy Melançon  and
Christophe Reutenauer
Guy Melançon
Affiliation:
UQAM, Montréal, Québec
Christophe Reutenauer
Affiliation:
UQAM and CNRS, Montréal, Québec
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

A Lyndon word is a primitive word which is minimum in its conjugation class, for the lexicographical ordering. These words have been introduced by Lyndon in order to find bases of the quotients of the lower central series of a free group or, equivalently, bases of the free Lie algebra [2], [7]. They have also many combinatorial properties, with applications to semigroups, pi-rings and pattern-matching, see [1], [10].

We study here the Poincaré-Birkhoff-Witt basis constructed on the Lyndon basis (PBWL basis). We give an algorithm to write each word in this basis: it reads the word from right to left, and the first encountered inversion is either bracketted, or straightened, and this process is iterated: the point is to show that each bracketting is a standard one: this we show by introducing a loop invariant (property (S)) of the algorithm. This algorithm has some analogy with the collecting process of P. Hall [5], but was never described for the Lyndon basis, as far we know.

Information

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 41 , Issue 4 , 01 August 1989 , pp. 577 - 591
Copyright
Copyright © Canadian Mathematical Society 1989

References

1. Duval, J. P., Factorizing words over an ordered alphabet, J. Algorithms 4 (1983), 363–381.Google Scholar
2. Chen, K. T., Fox, R. H. and Lyndon, R. C., Free differential calculus IV. - The quotient groups of the lower central series, Ann. Math. 68 (1958), 81–95.Google Scholar
3. Foata, D., La série génératrice exponentielle dans les problèmes d'énumération (Presses Univ. Montréal, 1974).Google Scholar
4. Hall, M. Jr, The theory of groups (Macmillan, New York, 1964).Google Scholar
5. Hall, P., A contribution to theory of groups of prime-power order, Proc. London Math. Soc. 36 (1933), 29–95.Google Scholar
6. Lothaire, M., Combinatorics on words (Reading, Massachusetts, 1983).Google Scholar
7. Lyndon, R. C., On Burnside problem I, Trans. Amer. Math. Soc. 77 (1954), 202–215.Google Scholar
8. Perrin, D.and Viennot, G., A note on shuffle algebras, unpublished manuscript (1981).Google Scholar
9. Radford, D. E., A natural ring basis for the shuffle algebra and an application to group schemes, Journal of Algebra 58 (1979), 432–453.Google Scholar
10. Reutenauer, C., Mots de Lyndon et un théorème de Shirshov, Ann. Sci. Maths. Québec 10 (1986), 237–245.Google Scholar
11. Schützenberger, M. P., Sur une propriété combinatoire des algèbres de Lie libres pouvant être utilisée dans un problème de mathématiques appliquées (Algèbre et Théorie des Nombres) Paris (1958/59).Google Scholar
12. Ree, R., Lie elements and an algebra associated with shuffles, Ann. Math 68 (1958), 210–220.Google Scholar
13. Sweedler, M. E., Hopf algebras (Benjamin, 1969).Google Scholar