Search arXivSearch

arXiv · 2508.10969

Promotion digraphs

Abstract

Work of Gaetz, Pechenik, Pfannerer, Striker, and Swanson (2024) introduced promotion permutations for a rectangular standard Young tableau $T$. These promotion permutations encode important features of $T$ and its orbit under Schützenberger's promotion operator. Indeed, the promotion permutations uniquely determine the tableau $T$. 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 $T$ when $T$ is standard of arbitrary shape. We show that an increasing tableau $T$ is not generally determined by its promotion digraphs but conjecture that it is when $T$ is rectangular. We provide evidence for this conjecture, including a complete characterization of the promotion digraphs for two-row rectangular increasing tableaux. We use promotion digraphs for three-row rectangular increasing tableaux to conjecture a connection between their dynamics and the flamingo webs recently introduced by Kim to give a diagrammatic basis of the Specht module $S^{(k^3,1^{n-3k})}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rebecca Patrias, Oliver Pechenik, Jessica Striker. 2026-07-09. Promotion digraphs. https://arxiv.org/abs/2508.10969

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO