Finely homogeneous computations in free Lie algebras (1997) [4 citations — 0 self]
by
Philippe Andary
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@MISC{Andary97finelyhomogeneous,
author = {Philippe Andary},
title = {Finely homogeneous computations in free Lie algebras},
year = {1997}
}
author = {Philippe Andary},
title = {Finely homogeneous computations in free Lie algebras},
year = {1997}
}
Bookmarks
OpenURL
Abstract:
Introduction Let A # fa 1 #a 2 #####a k gbe a set with k elements, and QhAi the associative (non-commutative) algebra on A. Defining a Lie bracket (#x# y##xy # yx)onthisQ-module turns it into a Lie algebra, and we will denote by L#A# its Lie subalgebra generated by A (i.e. L#A# is the free Lie algebra on A and QhAi its enveloping algebra). A will now be called an alphabet, whose elements are the letters,andA # is the free monoid (the set of all words) over A. We know that<F9.1
Citations
| 353 | in ‘‘Algebraic Combinatorics on Words – Lothaire |
| 218 | The Art of Computer Programming, Vol. 2 (Seminumerical Algorithms – Knuth - 1969 |
| 99 | Combinatorial Algorithms – Nijenhuis, Wilf - 1978 |
| 83 | Free Lie algebras – Reutenauer - 1993 |
| 12 | Algèbres de Lie libres et Monoïdes Libres – Viennot - 1978 |
| 10 | G'en'eration d'une section des classes de conjugaison et arbre des mots de Lyndon de longueur born'ee – Duval - 1988 |
| 10 | Free differential calculus IV. The quotient groups of the lower central series – Chen, Fox, et al. - 1958 |
| 9 | Average cost of Duval's algorithm for generating Lyndon words – Berstel, Pocchiola - 1994 |
| 1 | Combinatorics in trace monoids – Duchamp, Krob - 1994 |
