On the support of graph Lie algebras

DOI10.1016/S0304-3975(00)00446-1zbMath1014.68089MaRDI QIDQ1605344

Jean-Gabriel Luque, Gérard H. E. Duchamp, E. Laugerotte

Publication date: 15 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

simple support\(f\)-minimal independence alphabetgraph Lie algebrasindependence alphabet

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Related Items

On twin and anti-twin words in the support of the free Lie algebra

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Subgroups of graph groups
• Graph groups, coherence, and three-manifolds
• Lie elements and an algebra associated with shuffles
• Le support de l'algèbre de Lie libre. (Support of the free Lie algebra)
• Realisation locale des systèmes non linéaires, algèbres de Lie filtrees transitives et séries generatrices non commutatives
• The shuffle algebra on the factors of a word is free
• Integrité des algèbres de séries formelles sur un alphabet partiellement commutatif
• Génération d'une section des classes de conjugaison et arbre des mots de Lyndon de longueur bornée. (Generation of a section of conjugation classes and trees of Lyndon words of bounded length)
• Graph algebras
• The free partially commutative Lie algebra: Bases and ranks
• Free Lie algebras and free monoids. Bases of free Lie algebras and factorizations of free monoids
• Counting permutations with given cycle structure and descent set
• A rationality criterion coming from noncommutative geometry
• Lyndon words, polylogarithms and the Riemann \(\zeta\) function
• Orthogonal projection onto the free Lie algebra
• Free partially commutative structures
• Combinatorial problems of commutation and rearrangements
• Computing with P.B.W. in enveloping algebras
• Characterizations of the decidability of some problems for regular trace languages