witt basis
Recently Published Documents


TOTAL DOCUMENTS

7
(FIVE YEARS 1)

H-INDEX

3
(FIVE YEARS 0)

Author(s):  
Joan Bellier-Millès ◽  
Bérénice Delcroix-Oger ◽  
Eric Hoffbeck
Keyword(s):  

2003 ◽  
Vol 75 (1) ◽  
pp. 9-21 ◽  
Author(s):  
Manfred Schocker

AbstractThe higher Lie characters of the symmetric group Sn arise from the Poincaré-Birkhoff-Witt basis of the free associative algebra. They are indexed by the partitions of n and sum up to the regular character of Sn. A combinatorial description of the multiplicities of their irreducible components is given. As a special case the Kraśkiewicz-Weyman result on the multiplicities of the classical Lie character is obtained.


1989 ◽  
Vol 41 (4) ◽  
pp. 577-591 ◽  
Author(s):  
Guy Melançon ◽  
Christophe Reutenauer

A Lyndon word is a primitive word which is minimum in its conjugation class, for the lexicographical ordering. These words have been introduced by Lyndon in order to find bases of the quotients of the lower central series of a free group or, equivalently, bases of the free Lie algebra [2], [7]. They have also many combinatorial properties, with applications to semigroups, pi-rings and pattern-matching, see [1], [10].We study here the Poincaré-Birkhoff-Witt basis constructed on the Lyndon basis (PBWL basis). We give an algorithm to write each word in this basis: it reads the word from right to left, and the first encountered inversion is either bracketted, or straightened, and this process is iterated: the point is to show that each bracketting is a standard one: this we show by introducing a loop invariant (property (S)) of the algorithm. This algorithm has some analogy with the collecting process of P. Hall [5], but was never described for the Lyndon basis, as far we know.


Sign in / Sign up

Export Citation Format

Share Document