Bijection between trees in Stanley character formula and factorizations of a cycle
arXiv:2210.04478 · doi:10.37236/11577
Abstract
Stanley and Féray gave a formula for the irreducible character of the symmetric group related to a multi-rectangular Young diagram. This formula shows that the character is a polynomial in the multi-rectangular coordinates and gives an explicit combinatorial interpretation for its coefficients in terms of counting certain decorated maps (i.e., graphs drawn on surfaces). In the current paper we concentrate on the coefficients of the top-degree monomials in the Stanley character polynomial, which corresponds to counting certain decorated plane trees. We give an explicit bijection between such trees and minimal factorizations of a cycle.
arXiv comment64 pages
References in corpus (7)
- Explicit combinatorial interpretation of Kerov character polynomials as numbers of permutation factorizations
- Irreducible Symmetric Group Characters of Rectangular Shape
- Proof of Stanley's conjecture about irreducible character values of the symmetric group
- Combinatorial interpretation and positivity of Kerov's character polynomials
- A conjectured combinatorial interpretation of the normalized irreducible character values of the symmetric group
- The Algebra of Conjugacy Classes in Symmetric Groups and Partial Permutations
- Stanley character polynomials