Combinatorial Hopf algebras, noncommutative Hall-Littlewood functions, and permutation tableaux

We introduce a new family of noncommutative analogues of the Hall-Littlewood symmetric functions. Our construction relies upon Tevlin's bases and simple q-deformations of the classical combinatorial Hopf algebras. We connect our new Hall-Littlewood functions to permutation tableaux, and also give an exact formula for the q-enumeration of permutation tableaux of a fixed shape. This gives an explicit formula for: the steady state probability of each state in the partially asymmetric exclusion process (PASEP); the polynomial enumerating permutations with a fixed set of weak excedances according to crossings; the polynomial enumerating permutations with a fixed set of descent bottoms according to occurrences of the generalized pattern 2-31.Comment: 37 pages, 4 figures, new references adde

Lattice congruences, fans and Hopf algebras

We give a unified explanation of the geometric and algebraic properties of two well-known maps, one from permutations to triangulations, and another from permutations to subsets. Furthermore we give a broad generalization of the maps. Specifically, for any lattice congruence of the weak order on a Coxeter group we construct a complete fan of convex cones with strong properties relative to the corresponding lattice quotient of the weak order. We show that if a family of lattice congruences on the symmetric groups satisfies certain compatibility conditions then the family defines a sub Hopf algebra of the Malvenuto-Reutenauer Hopf algebra of permutations. Such a sub Hopf algebra has a basis which is described by a type of pattern-avoidance. Applying these results, we build the Malvenuto-Reutenauer algebra as the limit of an infinite sequence of smaller algebras, where the second algebra in the sequence is the Hopf algebra of non-commutative symmetric functions. We also associate both a fan and a Hopf algebra to a set of permutations which appears to be equinumerous with the Baxter permutations.Comment: 34 pages, 1 figur

Hopf algebras of endomorphisms of Hopf algebras

In the last decennia two generalizations of the Hopf algebra of symmetric functions have appeared and shown themselves important, the Hopf algebra of noncommutative symmetric functions NSymm and the Hopf algebra of quasisymmetric functions QSymm. It has also become clear that it is important to understand the noncommutative versions of such important structures as Symm the Hopf algebra of symmetric functions. Not least because the right noncommmutative versions are often more beautiful than the commutaive ones (not all cluttered up with counting coefficients). NSymm and QSymm are not truly the full noncommutative generalizations. One is maximally noncommutative but cocommutative, the other is maximally non cocommutative but commutative. There is a common, selfdual generalization, the Hopf algebra of permutations of Malvenuto, Poirier, and Reutenauer (MPR). This one is, I feel, best understood as a Hopf algebra of endomorphisms. In any case, this point of view suggests vast generalizations leading to the Hopf algebras of endomorphisms and word Hopf algebras with which this paper is concerned. This point of view also sheds light on the somewhat mysterious formulas of MPR and on the question where all the extra structure (such as autoduality) comes from. The paper concludes with a few sections on the structure of MPR and the question of algebra retractions of the natural inclusion of Hopf algebras of NSymm into MPR and section of the naural projection of MPR onto QSymm.Comment: 40 pages. Revised and expanded version of a (nonarchived) preprint of 200

The Magnus expansion, trees and Knuth's rotation correspondence

W. Magnus introduced a particular differential equation characterizing the logarithm of the solution of linear initial value problems for linear operators. The recursive solution of this differential equation leads to a peculiar Lie series, which is known as Magnus expansion, and involves Bernoulli numbers, iterated Lie brackets and integrals. This paper aims at obtaining further insights into the fine structure of the Magnus expansion. By using basic combinatorics on planar rooted trees we prove a closed formula for the Magnus expansion in the context of free dendriform algebra. From this, by using a well-known dendriform algebra structure on the vector space generated by the disjoint union of the symmetric groups, we derive the Mielnik-Pleba\'nski-Strichartz formula for the continuous Baker-Campbell-Hausdorff series

The # product in combinatorial Hopf algebras

We show that the # product of binary trees introduced by Aval and Viennot [arXiv:0912.0798] is in fact defined at the level of the free associative algebra, and can be extended to most of the classical combinatorial Hopf algebras.Comment: 20 page

Hopf Algebras of m-permutations, (m+1)-ary trees, and m-parking functions

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 page

Generic rectangulations

A rectangulation is a tiling of a rectangle by a finite number of rectangles. The rectangulation is called generic if no four of its rectangles share a single corner. We initiate the enumeration of generic rectangulations up to combinatorial equivalence by establishing an explicit bijection between generic rectangulations and a set of permutations defined by a pattern-avoidance condition analogous to the definition of the twisted Baxter permutations.Comment: Final version to appear in Eur. J. Combinatorics. Since v2, I became aware of literature on generic rectangulations under the name rectangular drawings. There are results on asymptotic enumeration and computations counting generic rectangulations with n rectangles for many n. This result answers an open question posed in the rectangular drawings literature. See "Note added in proof.

Hopf algebras and Markov chains: Two examples and a theory

The operation of squaring (coproduct followed by product) in a combinatorial Hopf algebra is shown to induce a Markov chain in natural bases. Chains constructed in this way include widely studied methods of card shuffling, a natural "rock-breaking" process, and Markov chains on simplicial complexes. Many of these chains can be explictly diagonalized using the primitive elements of the algebra and the combinatorics of the free Lie algebra. For card shuffling, this gives an explicit description of the eigenvectors. For rock-breaking, an explicit description of the quasi-stationary distribution and sharp rates to absorption follow.Comment: 51 pages, 17 figures. (Typographical errors corrected. Further fixes will only appear on the version on Amy Pang's website, the arXiv version will not be updated.