Bijection between trees in Stanley character formula and factorizations of a cycle
From MaRDI portal
Publication:2680906
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Representations of finite symmetric groups (20C30)
Recommendations
- A simple model of trees for unicellular maps
- Stanley's character polynomials and coloured factorisations in the symmetric group
- Direct bijective computation of the generating series for 2 and 3-connection coefficients of the symmetric group
- A bijective proof of Jackson's formula for the number of factorizations of a cycle
- A simple model of trees for unicellular maps
Cites work
- An explicit form for Kerov's character polynomials
- Bijection between trees in Stanley character formula and factorizations of a cycle
- Combinatorial interpretation and positivity of Kerov's character polynomials
- Explicit combinatorial interpretation of Kerov character polynomials as numbers of permutation factorizations
- Irreducible symmetric group characters of rectangular shape.
- Stanley character polynomials
- Stanley's formula for characters of the symmetric group.
- Two positivity conjectures for Kerov polynomials
Cited in
(6)- A combinatorial interpretation of the bijection of Goulden and Yong
- Bijection between trees in Stanley character formula and factorizations of a cycle
- Bijection between trees in Stanley character formula and factorizations of a cycle
- Bijections for Cayley trees, spanning trees, and their q-analogues
- On trees and characters
- Labelled trees and factorizations of a cycle into transpositions
This page was built for publication: Bijection between trees in Stanley character formula and factorizations of a cycle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2680906)