Hopf algebras of \(m\)-permutations, \((m + 1)\)-ary trees, and \(m\)-parking functions (Q2307437)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Hopf algebras of \(m\)-permutations, \((m + 1)\)-ary trees, and \(m\)-parking functions |
scientific article |
Statements
Hopf algebras of \(m\)-permutations, \((m + 1)\)-ary trees, and \(m\)-parking functions (English)
0 references
27 March 2020
0 references
The Loday-Ronco Hopf algebra of planar binary trees can be seen as a Hopf subalgebra of the algebra of permutations, generated by sum of permutations given by the sylvester congruence; similarly, the plactic congruence gives a Hopf subalgebra of standard Young tableaux. For both these subalgebras, the product is given by intervals in suitable posets, respectively Tamari for trees and Melnikov for tableaux. These results are generalized to a family of Hopf algebras indexed by a positive integer \(m\). A \(m\)-permutation is a shuffle of \(m\) permutations of the same length; they generate a Hopf algebra. Similar objects are defined on \(m\)-packed words and on \(m\)-parking functions. Three congruences are defined on \(m\)-permutations: the sylvester one, giving a Hopf subalgebra of \(m+1\)-ary planar trees, which product is given by intervals in the \(m\)-Tamari posets; the metasylvester one, giving a Hopf subalgebra of decreasing \(m+1\)-ary trees (as these objects are not in bijections with \(m\)-permutations, except if \(m=1\)); the hyposylvester one, giving a Hopf subalgebran such that the dimension of the graded components of degree \(n\) is \((m+1)^{n-1}\). Similar results are given for \(m\)-packed words and \(m\)-parking functions. The dimensions of the components of all these Hopf algebras are computed, giving a link with \(m\)-Narayana polynomials.
0 references
combinatorial Hopf algebras
0 references
noncommutative symmetric functions
0 references
quasi-symmetric functions
0 references
parking functions
0 references
operads
0 references
0 references
0 references
0 references