The algebraic combinatorics of snakes

Journal of Combinatorial Theory Series A (Impact Factor: 0.78). 10/2011; 119(8). DOI: 10.1016/j.jcta.2012.05.002
Source: arXiv


Snakes are analogues of alternating permutations defined for any Coxeter
group. We study these objects from the point of view of combinatorial Hopf
algebras, such as noncommutative symmetric functions and their generalizations.
The main purpose is to show that several properties of the generating functions
of snakes, such as differential equations or closed form as trigonometric
functions, can be lifted at the level of noncommutative symmetric functions or
free quasi-symmetric functions. The results take the form of algebraic
identities for type B noncommutative symmetric functions, noncommutative
supersymmetric functions and colored free quasi-symmetric functions.

Download full-text


Available from: Jean-Christophe Novelli
  • Source
    • "Recall from [8] "
    [Show abstract] [Hide abstract]
    ABSTRACT: We investigate the connections between various noncommutative analogues of Hall-Littlewood and Macdonald polynomials, and define some new families of noncommutative symmetric functions depending on two sequences of parameters.
    Preview · Article · Apr 2013 · International Journal of Algebra and Computation
  • Source
    • "As for the solution X, it is just the sum of all G σ , that is, the sum of all words. This interpretation leads to simple derivations of the q-hook length formulas for binary trees [6], as well as to the combinatorial interpretations of various special functions such as the tangent [7] or possibly the Jacobi elliptic functions. 2.6. "
    [Show abstract] [Hide abstract]
    ABSTRACT: We provide operadic interpretations for two Hopf subalgebras of the algebra of parking functions. The Catalan subalgebra is identified with the free duplicial algebra on one generator, and the Schr\"oder subalgebra is interpreted by means of a new operad, which we call triduplicial. The noncommutative Lagrange inversion formula is then interpreted in terms of duplicial structures. The generic solution of the noncommutative inversion problem appears as the formal sum of all parking functions. This suggests that combinatorial generating functions derived by functional inversion should be obtainable by evaluating a suitable character on this generic solution. This idea is illustrated by means of the Narayana polynomials, of which we obtain bivariate "super-analogues" by lifting to parking functions a classical character of the algebra of symmetric functions. Other characters, such as evaluation of symmetric functions on a binomial element, are also discussed.
    Preview · Article · Sep 2012
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: It is known that Euler numbers, defined as the Taylor coefficients of the tangent and secant functions, count alternating permutations in the symmetric group. Springer defined a generalization of these numbers for each finite Coxeter group by considering the largest descent class, and computed the value in each case of the classification. We consider here another generalization of Euler numbers for finite Coxeter groups, building on Stanley's result about the number of orbits of maximal chains of set partitions. We present a method to compute these integers and obtain the value in each case of the classification.
    Preview · Article · Apr 2013 · Annals of Combinatorics
Show more