Abstract

Combinatorics M.-P. Schutzenberger asked to determine the support of the free Lie algebra L(Zm) (A) on a finite alphabet A over the ring Z(m) of integers mod m and all pairs of twin and anti-twin words, i.e., words that appear with equal (resp. opposite) coefficients in each Lie polynomial. We characterize the complement of the support of L(Zm) (A) in A* as the set of all words w such that m divides all the coefficients appearing in the monomials of l* (w), where l* is the adjoint endomorphism of the left normed Lie bracketing l of the free Lie ring. Calculating l* (w) via the shuffle product, we recover the well known result of Duchamp and Thibon (Discrete Math. 76 (1989) 123-132) for the support of the free Lie ring in a much more natural way. We conjecture that two words u and v of common length n, which lie in the support of the free Lie ring, are twin (resp. anti-twin) if and only if either u = v or n is odd and u = (v) over tilde (resp. if n is even and u = (v) over tilde), where (v) over tilde denotes the reversal of v and we prove that it suffices to show this for a two-lettered alphabet. These problems can be rephrased, for words of length n, in terms of the action of the Dynkin operator l(n) on lambda-tabloids, where lambda is a partition of n. Representing a word w in two letters by the subset I of [n] = \1, 2, ... , n\ that consists of all positions that one of the letters occurs in w, the computation of l* (w) leads us to the notion of the Pascal descent polynomial p(n)(I), a particular commutative multi-linear polynomial which is equal to the signed binomial coefficient when vertical bar I vertical bar = 1. We provide a recursion formula for p(n) (I) and show that if m inverted iota Sigma(i is an element of I)(1)(i-1) (n - 1 i - 1), then w lies in the support of L(Zm) (A).

Highlights

  • IntroductionProblem 1.4 Determine all twin and anti-twin pairs of words with respect to LZm (A), for m > 1

  • Let A be a finite alphabet, A∗ be the free monoid on A and A+ = A∗ \ { } be the free semigroup on A, with denoting the empty word

  • Problem 1.2 is equivalent to determining all subsets I of [n] such that pn(I) ≡ 0. The latter leads us to an explicitly stated sufficient condition for a word w to lie in the support of the free Lie algebra LZm (A): namely m Nn(I), where n = |w|, I = I(w) is the subset of [n] consisting of the positions that one of the two letters occurs in w and Nn(I) =

Read more

Summary

Introduction

Problem 1.4 Determine all twin and anti-twin pairs of words with respect to LZm (A), for m > 1 In view of these problems Schutzenberger considered, for each word w ∈ A∗, the smallest non-negative integer - which we denote by c(w) - that appears as a coefficient of w in some Lie polynomial over Z. Problem 1.2 is equivalent to determining all subsets I of [n] such that pn(I) ≡ 0 (mod m) The latter leads us to an explicitly stated sufficient condition for a word w to lie in the support of the free Lie algebra LZm (A): namely m Nn(I), where n = |w|, I = I(w) is the subset of [n] consisting of the positions that one of the two letters occurs in w and Nn(I) =.

Preliminary results
Pascal descent polynomials
Further Research
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.