On the support of graph Lie algebras

Authors:
G. Duchamp;É. Laugerotte;J.-G. Luque
Affiliations:
Laboratoire d'Informatique Fondamentale et Appliquée de Rouen, Mont-Saint-Aignan, France;Laboratoire d'Informatique Fondamentale et Appliquée de Rouen, Mont-Saint-Aignan, France;Laboratoire d'Informatique Fondamentale et Appliquée de Rouen, Mont-Saint-Aignan, France
Venue:
Theoretical Computer Science
Year:
2002

Citing 8
Cited 1

Integrity of formal power series on a partially commutative alphabet

Theoretical Computer Science
Generation of a section of conjugation classes and Lyndon word tree of limited length

Theoretical Computer Science
The support of free Lie algebras

Discrete Mathematics
Orthogonal projection onto the free Lie algebra

Theoretical Computer Science - Theme issue on the algebraic and computing treatment of noncommutative power series
Counting permutations with given cycle structure and descent set

Journal of Combinatorial Theory Series A
Automata, Languages, and Machines

Automata, Languages, and Machines
The Book of Traces

The Book of Traces
Partially Commutative Lyndon Words

STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science

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

Journal of Algebraic Combinatorics: An International Journal

Quantified Score

Hi-index	5.23

Visualization

Abstract

We deal with the support of graph Lie algebras and we characterize the set of independence alphabets for which the noncommutative result can naturally be extended. We also provide an algorithm which decides if an independence alphabet fulfills the preceding condition.