Search

The m-Tamari lattice of F. Bergeron is an analogue of the clasical Tamari order defined on objects counted by Fuss-Catalan numbers, such as m-Dyck paths or (m+1)-ary trees. On another hand, the Tamari order is related to the product in the Loday-Ronco Hopf algebra of planar binary trees. We introduce new combinatorial Hopf algebras based on (m+1)-ary trees, whose structure is described by the m-Tamari lattices. In the same way as planar binary trees can be interpreted as sylvester classes of permutations, we obtain (m+1)-ary trees as sylvester classes of what we call m-permutations. These objects are no longer in bijection with decreasing (m+1)-ary trees, and a finer congruence, called metasylvester, allows us to build Hopf algebras based on these decreasing trees. At the opposite, a coarser congruence, called hyposylvester, leads to Hopf algebras of graded dimensions (m+1)^{n-1}, generalizing noncommutative symmetric functions and quasi-symmetric functions in a natural way. Finally, the algebras of packed words and parking functions also admit such m-analogues, and we present their subalgebras and quotients induced by the various congruences., Comment: 51 pages

The Hopf algebra of word-quasi-symmetric functions ($\WQSym$), a noncommutative generalization of the Hopf algebra of quasi-symmetric functions, can be endowed with an internal product that has several compatibility properties with the other operations on $\WQSym$. This extends constructions familiar and central in the theory of free Lie algebras, noncommutative symmetric functions and their various applications fields, and allows to interpret $\WQSym$ as a convolution algebra of linear endomorphisms of quasi-shuffle algebras. We then use this interpretation to study the fine structure of quasi-shuffle algebras (MZVs, free Rota-Baxter algebras...). In particular, we compute their Adams operations and prove the existence of generalized Eulerian idempotents, that is, of a canonical left-inverse to the natural surjection map to their indecomposables, allowing for the combinatorial construction of free polynomial generators for these algebras., Comment: 18 pages

We construct explicit polynomial realizations of some combinatorial Hopf algebras based on various kind of trees or forests, and some more general classes of graphs, ranging from the Connes-Kreimer algebra to an algebra of labelled forests isomorphic to the Hopf algebra of parking functions, and to a new noncommutative algebra based on endofunctions admitting many interesting subalgebras and quotients., Comment: 20 pages

We extend to several combinatorial Hopf algebras the endomorphism of symmetric functions sending the first power-sum to zero and leaving the other ones invariant. As a transformation of alphabets, this is the (1-E)-transform, where E is the exponential alphabet, whose elementary symmetric functions are e_n=1/n!. In the case of noncommutative symmetric functions, we recover Schocker's idempotents for derangement numbers [Discr. Math. 269 (2003), 239]. From these idempotents, we construct subalgebras of the descent algebras analogous to the peak algebras and study their representation theory. The case of WQSym leads to similar subalgebras of the Solomon-Tits algebras. In FQSym, the study of the transformation boils down to a simple solution of the Tsetlin library in the uniform case., Comment: 33 pages

Descents in permutations or words are defined from the relative position of two consecutive letters. We investigate a statistic involving patterns of k consecutive letters, and show that it leads to Hopf algebras generalizing noncommutative symmetric functions and quasi-symmetric functions., Comment: 8 pages

We propose several constructions of commutative or cocommutative Hopf algebras based on various combinatorial structures, and investigate the relations between them. A commutative Hopf algebra of permutations is obtained by a general construction based on graphs, and its non-commutative dual is realized in three different ways, in particular as the Grossman-Larson algebra of heap ordered trees. Extensions to endofunctions, parking functions, set compositions, set partitions, planar binary trees and rooted forests are discussed. Finally, we introduce one-parameter families interpolating between different structures constructed on the same combinatorial objects., Comment: 29 pages, LaTEX; expanded and updated version of math.CO/0502456

We realize several combinatorial Hopf algebras based on set compositions, plane trees and segmented compositions in terms of noncommutative polynomials in infinitely many variables. For each of them, we describe a trialgebra structure, an internal product, and several bases., Comment: 12 pages, LaTEX, to be presented at FPSAC'06

A result of Foata and Schutzenberger states that two statistics on permutations, the number of inversions and the inverse major index, have the same distribution on a descent class. We give a multivariate generalization of this property: the sorted vectors of the Lehmer code, of the inverse majcode, and of a new code (the inverse saillance code), have the same distribution on a descent class, and their common multivariate generating function is a flagged ribbon Schur function., Comment: 17 pages, LaTex; Minor correction in the proof of Lemma 6.5; one reference added

After reformulating the representation theory of 0-Hecke algebras in an appropriate family of Yang-Baxter bases, we investigate certain specializations of the Ariki-Koike algebras, obtained by setting q=0 in a suitably normalized version of Shoji's presentation. We classify the simple and projective modules, and describe restrictions, induction products, Cartan invariants and decomposition matrices. This allows us to identify the Grothendieck rings of the towers of algebras in terms of certain graded Hopf algebras known as the Mantaci-Reutenauer descent algebras, and Poirier quasi-symmetric functions. We also describe the Ext-quivers, and conclude with numerical tables., Comment: 46 pages, LaTEX

We propose several constructions of commutative or cocommutative Hopf algebras based on various combinatorial structures, and investigate the relations between them. A commutative Hopf algebra of permutations is obtained by a general construction based on graphs, and its non-commutative dual is realized in three different ways, in particular as the Grossman-Larson algebra of heap ordered trees. Extensions to endofunctions, parking functions, set partitions, planar binary trees and rooted forests are discussed. Finally, we introduce one-parameter families interpolating between different structures constructed on the same combinatorial objects., Comment: 18 pages, LaTEX

We investigate the representation theory of certain specializations of the Ariki-Koike algebras, obtained by setting $q=0$ in a suitably normalized version of Shoji's presentation. We classify the simple and projective modules, and describe restrictions, induction products, Cartan invariants and decomposition matrices. This allows us to identify the Grothendieck rings of the towers of algebras in terms of certain graded Hopf algebras known as the Mantaci-Reutenauer descent algebras, and Poirier Quasi-symmetric functions., Comment: 12 pages; LaTEX

We introduce a monoid structure on the set of binary search trees, by a process very similar to the construction of the plactic monoid, the Robinson-Schensted insertion being replaced by the binary search tree insertion. This leads to a new construction of the algebra of Planar Binary Trees of Loday-Ronco, defining it in the same way as Non-Commutative Symmetric Functions and Free Symmetric Functions. We briefly explain how the main known properties of the Loday-Ronco algebra can be described and proved with this combinatorial point of view, and then discuss it from a representation theoretical point of view, which in turns leads to new combinatorial properties of binary trees., Comment: 49 pages