AbstractWe 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
International audienceWe first give a fast algorithm to compute the maximal Lyndon word (with respec...
National audienceFamilies of binary relations are important interpretations of regular expressions, ...
AbstractFor a field K and directed graph E, we analyze those elements of the Leavitt path algebra LK...
AbstractWe deal with the support of graph Lie algebras and we characterize the set of independence a...
CombinatoricsInternational audienceM.-P. Schutzenberger asked to determine the support of the free L...
AbstractThis paper shows how to uniformly associate Lie algebras to the simply-laced Dynkin diagrams...
CombinatoricsM.-P. Schutzenberger asked to determine the support of the free Lie algebra L(Zm) (A) o...
In this work, we prove that partially commutative, partially commutative metabelian, or partially co...
In this work, we prove that partially commutative, partially commutative metabelian, or partially co...
AbstractAs an answer to a question of Garsia, we give a universal formula in a “normal form” for the...
This paper deals with several operations on graphs and combinatorial structures linking them with th...
AbstractLet X be an ordered alphabet. Lie2(n) (and P2(n) respectively) are the multilinear parts of ...
AbstractThe shuffle algebra generated by the factors of a given word is shown to be free, with trans...
AbstractWe study the subgroup generated by the exponentials of formal Lie series. We show three diff...
AbstractThe Free Lie Algebra over an alphabet A, denoted here by LIE[A], is the smallest subspace of...
International audienceWe first give a fast algorithm to compute the maximal Lyndon word (with respec...
National audienceFamilies of binary relations are important interpretations of regular expressions, ...
AbstractFor a field K and directed graph E, we analyze those elements of the Leavitt path algebra LK...
AbstractWe deal with the support of graph Lie algebras and we characterize the set of independence a...
CombinatoricsInternational audienceM.-P. Schutzenberger asked to determine the support of the free L...
AbstractThis paper shows how to uniformly associate Lie algebras to the simply-laced Dynkin diagrams...
CombinatoricsM.-P. Schutzenberger asked to determine the support of the free Lie algebra L(Zm) (A) o...
In this work, we prove that partially commutative, partially commutative metabelian, or partially co...
In this work, we prove that partially commutative, partially commutative metabelian, or partially co...
AbstractAs an answer to a question of Garsia, we give a universal formula in a “normal form” for the...
This paper deals with several operations on graphs and combinatorial structures linking them with th...
AbstractLet X be an ordered alphabet. Lie2(n) (and P2(n) respectively) are the multilinear parts of ...
AbstractThe shuffle algebra generated by the factors of a given word is shown to be free, with trans...
AbstractWe study the subgroup generated by the exponentials of formal Lie series. We show three diff...
AbstractThe Free Lie Algebra over an alphabet A, denoted here by LIE[A], is the smallest subspace of...
International audienceWe first give a fast algorithm to compute the maximal Lyndon word (with respec...
National audienceFamilies of binary relations are important interpretations of regular expressions, ...
AbstractFor a field K and directed graph E, we analyze those elements of the Leavitt path algebra LK...
DOI
Add to ORKG