10.46298/dmtcs.236
https://dmtcs.episciences.org/236
Andary, Philippe
Philippe
Andary
Finely homogeneous computations in free Lie algebras
We first give a fast algorithm to compute the maximal Lyndon word (with respect to lexicographic order) of \textitLy_α (A) for every given multidegree alpha in \textbfN^k. We then give an algorithm to compute all the words living in \textitLy_α (A) for any given α in \textbfN^k. The best known method for generating Lyndon words is that of Duval [1], which gives a way to go from every Lyndon word of length n to its successor (with respect to lexicographic order by length), in space and worst case time complexity O(n). Finally, we give a simple algorithm which uses Duval's method (the one above) to compute the next standard bracketing of a Lyndon word for lexicographic order by length. We can find an interesting application of this algorithm in control theory, where one wants to compute within the command Lie algebra of a dynamical system (letters are actually vector fields).
episciences.org
finely homogeneous computations
Lie algebras
[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]
2015-06-09
1997-01-01
1997-01-01
en
journal article
https://hal.science/hal-00955693v1
1365-8050
https://dmtcs.episciences.org/236/pdf
VoR
application/pdf
Discrete Mathematics & Theoretical Computer Science
Vol. 1
Researchers
Students