Explicit formulae for Kerov polynomials
From MaRDI portal
Abstract: We prove a formula expressing the Kerov polynomial as a weighted sum over the lattice of noncrossing partitions of the set . In particular, such a formula is related to a partial order on the Lehner's irreducible noncrossing partitions which can be described in terms of left-to-right minima and maxima, descents and excedances of permutations. This provides a translation of the formula in terms of the Cayley graph of the symmetric group and allows us to recover the coefficients of by means of the posets and of pattern-avoiding permutations discovered by B'ona and Simion. We also obtain symmetric functions specializing in the coefficients of .
Recommendations
Cites work
- scientific article; zbMATH DE number 739282 (Why is no real title available?)
- scientific article; zbMATH DE number 1974576 (Why is no real title available?)
- An explicit form for Kerov's character polynomials
- Combinatorial interpretation and positivity of Kerov's character polynomials
- Cumulants and convolutions via Abel polynomials
- Explicit combinatorial interpretation of Kerov character polynomials as numbers of permutation factorizations
- Free cumulants and enumeration of connected partitions
- Generalized noncrossing partitions and combinatorics of Coxeter groups
- Lectures on the Combinatorics of Free Probability
- Multiplicative functions on the lattice of non-crossing partitions and free convolution
- On the formula of Goulden and Rattan for Kerov polynomials
- Representations of symmetric groups and free probability
- Some properties of crossings and partitions
- Two positivity conjectures for Kerov polynomials
Cited in
(13)- Anisotropic Young diagrams and Jack symmetric functions
- Combinatorics of a generalized Narayana identity
- Gaussian fluctuations of Young diagrams and structure constants of Jack characters
- Shifted symmetric functions and multirectangular coordinates of Young diagrams
- The ring of \(\mathcal {T}\)-covariants
- Noncrossing partitions, Bruhat order and the cluster complex
- Character polynomials, their \(q\)-analogs and the Kronecker product.
- Kerov functions revisited
- Christoffel formula for kernel polynomials on the unit circle
- Kerov functions for composite representations and Macdonald ideal
- Linear versus spin: representation theory of the symmetric groups
- An explicit form for Kerov's character polynomials
- On the formula of Goulden and Rattan for Kerov polynomials
This page was built for publication: Explicit formulae for Kerov polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q617328)