Promotion digraphs
Rebecca Patrias, Oliver Pechenik, and Jessica Striker

TL;DR
This paper introduces promotion digraphs for standard and increasing tableaux, generalizing promotion permutations, and explores their properties and connections to combinatorial structures and representation theory.
Contribution
It generalizes promotion permutations to promotion digraphs for arbitrary shapes and characterizes their properties, including connections to Specht modules and flamingo webs.
Findings
Promotion digraphs uniquely determine standard and rectangular increasing tableaux.
Complete characterization of promotion digraphs for two-row rectangular increasing tableaux.
Conjectured connection between promotion digraph dynamics and flamingo webs for three-row tableaux.
Abstract
Work of Gaetz, Pechenik, Pfannerer, Striker, and Swanson (2024) introduced promotion permutations for a rectangular standard Young tableau . These promotion permutations encode important features of and its orbit under Sch\"utzenberger's promotion operator. Indeed, the promotion permutations uniquely determine the tableau . We introduce more general promotion digraphs for both standard and increasing tableaux of arbitrary shape. For rectangular standard tableaux, this construction recovers the functional digraphs of the promotion permutations. Among other facts, we show that promotion digraphs uniquely determine when is standard of arbitrary shape or increasing of rectangular shape, but not when is increasing and general shape. We completely characterize the promotion digraphs for two-row rectangular increasing tableaux. We use promotion digraphs for three-row…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
