this paper, we develop an algorithm which generates the standard bracketing for all Lyndon words of length n, thus constructing a basis for the n-th homogeneous component of the free Lie algebra. The algorithm runs in linear amortized time; i.e., O(n) time per basis elemen
AbstractLet X be an ordered alphabet. Lie2(n) (and P2(n) respectively) are the multilinear parts of ...
The powerful concept of Gröbner bases and an extension of the Buchberger algorithm for their computa...
In this paper we present an algorithm to compute the Lyndon array of a string T of length n as a by...
International audienceWe first give a fast algorithm to compute the maximal Lyndon word (with respec...
AbstractIn this article we construct a basis of a free Lie algebra that consists of right normed wor...
International audienceWe derive a priori bounds on the size of the structure constants of the free L...
The set of all abelian subalgebras is computationally obtained for any given finite-dimensional Lie ...
The computer algebra system Maple contains a basic set of commands for working with Lie algebras. Th...
We derive a priori bounds on the size of the structure constants of the free Lie algebra over a set ...
This paper describes progress made in context with the construction of a general library of Lie alge...
This paper describes progress made in context with the construction of a general library of Lie al...
The free Lie algebra Lie[A] over the complex held, on an alphabet A, is the smallest subspace of the...
AbstractThe free Lie algebra Lie[A] over the complex held, on an alphabet A, is the smallest subspac...
CombinatoricsInternational audienceM.-P. Schutzenberger asked to determine the support of the free L...
AbstractAny word can be decomposed uniquely into lexicographically nonincreasing factors each one of...
AbstractLet X be an ordered alphabet. Lie2(n) (and P2(n) respectively) are the multilinear parts of ...
The powerful concept of Gröbner bases and an extension of the Buchberger algorithm for their computa...
In this paper we present an algorithm to compute the Lyndon array of a string T of length n as a by...
International audienceWe first give a fast algorithm to compute the maximal Lyndon word (with respec...
AbstractIn this article we construct a basis of a free Lie algebra that consists of right normed wor...
International audienceWe derive a priori bounds on the size of the structure constants of the free L...
The set of all abelian subalgebras is computationally obtained for any given finite-dimensional Lie ...
The computer algebra system Maple contains a basic set of commands for working with Lie algebras. Th...
We derive a priori bounds on the size of the structure constants of the free Lie algebra over a set ...
This paper describes progress made in context with the construction of a general library of Lie alge...
This paper describes progress made in context with the construction of a general library of Lie al...
The free Lie algebra Lie[A] over the complex held, on an alphabet A, is the smallest subspace of the...
AbstractThe free Lie algebra Lie[A] over the complex held, on an alphabet A, is the smallest subspac...
CombinatoricsInternational audienceM.-P. Schutzenberger asked to determine the support of the free L...
AbstractAny word can be decomposed uniquely into lexicographically nonincreasing factors each one of...
AbstractLet X be an ordered alphabet. Lie2(n) (and P2(n) respectively) are the multilinear parts of ...
The powerful concept of Gröbner bases and an extension of the Buchberger algorithm for their computa...
In this paper we present an algorithm to compute the Lyndon array of a string T of length n as a by...