Bijection between trees in Stanley character formula and factorizations of a cycle
zbMATH Open1505.05113MaRDI QIDQ2680906FDOQ2680906
Authors: Karolina Wojtyniak 
Publication date: 5 January 2023
Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)
Full work available at URL: https://www.mat.univie.ac.at/~slc/wpapers/FPSAC2021/25.html
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
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
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)
Cites Work
- An explicit form for Kerov's character polynomials
- Combinatorial interpretation and positivity of Kerov's character polynomials
- Explicit combinatorial interpretation of Kerov character polynomials as numbers of permutation factorizations
- Stanley's formula for characters of the symmetric group.
- Two positivity conjectures for Kerov polynomials
- Irreducible symmetric group characters of rectangular shape.
- Bijection between trees in Stanley character formula and factorizations of a cycle
- Stanley character polynomials
Cited In (4)
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)
