---
title: 'Promotion Digraphs: Combinatorial Dynamics'
url: https://www.emergentmind.com/topics/promotion-digraphs
type: topic
---

# Promotion Digraphs: Combinatorial Dynamics

Promotion digraphs are directed graphs whose vertices are combinatorial objects and whose directed edges record one application of a promotion operator. In the classical Schützenberger setting, the objects are linear extensions of a finite poset or standard Young tableaux of a fixed shape, and the operator is bijective; accordingly, the promotion digraph decomposes into disjoint directed cycles [0806.4717]. Later work transported the same dynamical viewpoint to Kreweras words, graph labelings, oscillating and alternating tableaux, webs, matchings, permutations, fans of Dyck paths, vacillating tableaux, and cluster-theoretic maps, while preserving the central question: how the orbit structure of promotion reflects the combinatorics and geometry of the underlying model [2005.14031].

## 1. Classical definition and foundational structure

For a finite poset \(P\) with \(\#P=p\), a linear extension is a bijection \(f:P\to[p]\) such that \(s<t\) in \(P\) implies \(f(s)<f(t)\). Writing a linear extension as a word \(u_1u_2\cdots u_p\), with \(u_i=f^{-1}(i)\), one defines involutions \(\tau_i\) by swapping \(u_i\) and \(u_{i+1}\) precisely when they are incomparable in \(P\). Schützenberger’s promotion is the product
\[
\partial=\tau_1\tau_2\cdots\tau_{p-1},
\]
equivalently the usual sliding procedure that removes the label \(1\), follows the promotion chain through covering relations, inserts \(p+1\), and then subtracts \(1\) from every label [0806.4717].

This yields the basic promotion digraph of \(P\): its vertices are the linear extensions \(\mathcal L(P)\), and there is a directed edge \(f\to f\partial\). Because promotion is a bijection, every vertex has out-degree \(1\) and in-degree \(1\), so the digraph is a disjoint union of directed cycles [0806.4717]. Evacuation \(\epsilon\) and dual evacuation \(\epsilon^*\) give additional symmetries, with
\[
\epsilon^2=1,\qquad \partial^p=\epsilon\epsilon^*,\qquad \partial\,\epsilon=\epsilon\,\partial^{-1},
\]
so the subgroup generated by \(\epsilon\) and \(\epsilon^*\) is dihedral, and evacuation acts as a reflection on promotion cycles [0806.4717].

The same framework specializes to standard Young tableaux. Promotion on tableaux is the jeu-de-taquin operation that removes \(1\), slides the empty box, inserts the largest label, and relabels. In this guise, promotion digraphs are the functional digraphs of promotion on \(\mathrm{SYT}(\lambda)\) for a fixed shape \(\lambda\) [1003.2728].

## 2. Regular orbit structure in rectangular and related tableau families

For rectangular standard Young tableaux of shape \(m^n\), Haiman’s theorem implies that
\[
\mathrm{pr}^{mn}(T)=T
\]
for all \(T\in \mathrm{SYT}(m^n)\), so every promotion cycle length divides \(mn\) [1407.0078]. The minimal possible orbit length is exactly \(n\), and the set \(O_n\) of tableaux of promotion order \(n\) has cardinality \(n!\). Purbhoo and Rhee give a bijection
\[
\Phi:S_n\to O_n,\qquad w\mapsto T_w,
\]
such that
\[
\mathrm{pr}(T_w)=T_{wc},
\]
where \(c=(1\,n\,n-1\,\dots\,2)\). Consequently, the induced sub-digraph on \(O_n\) is a disjoint union of \(n\)-cycles, indexed by the right cosets of \(\langle c\rangle\subset S_n\); since \(|O_n|=n!\), there are exactly \((n-1)!\) such cycles [1407.0078].

Pon and Wang analyze promotion and evacuation on standard Young tableaux of rectangular and staircase shape from the digraph perspective. For a rectangle \(c^r\) with \(n=rc\), promotion satisfies
\[
\partial^n(R)=R
\]
for all \(R\in \mathrm{SYT}(c^r)\). For staircase shape \(\mathrm{sc}_k\) with \(n=\frac{k(k+1)}{2}\), one has
\[
\partial^{2n}(S)=S,\qquad \partial^n(S)=S^t.
\]
Thus rectangular promotion digraphs decompose into cycles whose lengths divide \(rc\), while staircase promotion digraphs decompose into cycles whose lengths divide \(k(k+1)\), with the half-power acting by transpose [1003.2728].

The same paper constructs a promotion- and evacuation-preserving embedding
\[
\Phi:\mathrm{SYT}(\mathrm{sc}_k)\hookrightarrow \mathrm{SYT}(k^{k+1}),
\]
so the promotion digraph on staircase tableaux embeds into the promotion digraph on a rectangle, and promotion orbit sizes are preserved under this embedding [1003.2728].

## 3. Kreweras words, the poset \( {\sf V}\times[n] \), and exceptional regularity

A particularly symmetric promotion digraph arises from Kreweras words, which are words of length \(3n\) with exactly \(n\) copies of each of \(A,B,C\) such that every prefix has at least as many \(A\)'s as \(B\)'s and at least as many \(A\)'s as \(C\)'s. Equivalently, they are the linear extensions of the poset
\[
V(n):={\sf V}\times[n],
\]
where \({\sf V}\) is the 3-element \(V\)-shaped poset with relations \(B<A\) and \(C<A\) [2005.14031].

Hopkins and Rubey prove the central dynamical theorem
\[
\pro^{3n}(w)=\overline w,
\]
where \(\overline w\) is obtained from \(w\) by swapping all \(B\)'s and \(C\)'s. Hence
\[
\pro^{6n}(w)=w,
\]
and every orbit in the promotion digraph has size either \(3n\) or \(6n\) [2005.14031]. In digraph terms, the graph on Kreweras words is a disjoint union of directed cycles, and the \(3n\)-th power of promotion acts as a global involution.

This is significant because it gives the first answer to Stanley’s question about posets with “good” behavior under promotion outside the four families classified by Haiman: for \(P=V(n)\), the power \(\pro^{\#P}=\pro^{3n}\) is a simple symmetry, namely \(B\leftrightarrow C\) [2005.14031].

The same paper transports the promotion digraph to two other models. First, Kreweras words map to irreducible \(\mathfrak{sl}_3\)-webs, and promotion corresponds to rotation of the web:
\[
W_{\pro(w)}=\rot(W_w),\qquad W_{\evac(w)}=\flip(W_w).
\]
Second, the associated trip permutation \(\sigma_w\) satisfies
\[
\sigma_{\pro(w)}=(1,2,\dots,3n)^{-1}\sigma_w(1,2,\dots,3n),
\]
so promotion becomes literal rotation on permutations and on webs [2005.14031].

## 4. Graph-labeling analogues: toric and permutoric promotion

Defant’s toric promotion reframes promotion on graph labelings. For a simple graph \(G=(V,E)\) with \(n\) vertices, a labeling is a bijection \(\sigma:V\to[n]\). For adjacent labels \(i,i+1\), one defines toggles \(\tau_i\) that swap them precisely when their vertices are nonadjacent. Classical promotion becomes
\[
\Pro=\tau_{n-1}\cdots\tau_2\tau_1,
\]
and toric promotion is the cyclic analogue
\[
\TPro=\tau_n\tau_{n-1}\cdots\tau_2\tau_1,
\]
where \(\tau_n=\tau_{n,1}\) [2112.06843].

The toric promotion digraph has vertex set \(\Lambda_G\) and edges \(\sigma\to \TPro(\sigma)\). Since \(\TPro\) is a bijection, it is again a disjoint union of directed cycles. For forests, the orbit lengths admit a closed formula: if \(t\) is the size of the connected component containing the vertex labeled \(1\), then the orbit size is
\[
(n-1)\frac{t}{\gcd(t,n)}.
\]
In particular, if \(G\) is a tree, every orbit has size \(n-1\) [2112.06843].

Permutoric promotion replaces the natural cyclic order of the toggles by an arbitrary cyclic order \(\pi\). For \(G=\mathrm{Path}_n\), if \(d\) is the number of cyclic descents of \(\pi^{-1}\), then the order of the operator is
\[
d(n-d),
\]
and the full orbit structure satisfies a cyclic sieving phenomenon [2305.19961]. The same paper also proves that every orbit size is divisible by
\[
\operatorname{lcm}(d,n-d),
\]
which imposes strong arithmetic constraints on the promotion digraph [2305.19961].

More recent work studies the effect of graph operations on these digraphs. For toric promotion on bridge sums, uniform cycle lengths reappear: a complete graph \(K_n\) has orbit length \(n\), a tree on \(m\) vertices has orbit length \(m(m-1)\), and a bridge sum of trees and complete graphs with total vertex count \(N\) has orbit length \(N(N-1)\); the orbit length does not depend on the initial labeling in these cases [2512.00692].

## 5. Diagrammatic realizations: matchings, permutations, webs, and chord diagrams

Promotion digraphs often admit a second realization as rotation digraphs on planar diagrams. For \(n\)-symplectic oscillating tableaux of empty shape, Sundaram’s map sends the tableau to an \((n+1)\)-noncrossing perfect matching, and promotion becomes rotation of the chord diagram:
\[
\rot M(O)=M(\pr O),\qquad \rev M(O)=M(\ev O).
\]
Thus the promotion digraph on oscillating tableaux is isomorphic to the rotation digraph on noncrossing matchings [1804.06736].

For alternating tableaux associated with the adjoint representation of \(GL(n)\), the analogous map sends empty-shape tableaux to permutations. Under suitable bounds on \(n\), promotion again becomes rotation:
\[
\rot P(A)=P(\pr A),
\]
while evacuation becomes reverse-complement, or inverse reverse-complement in the \(n\le 2\) case [1804.06736]. In the \(GL(2)\) case, this identifies promotion with rotation on noncrossing set partitions [1804.06736].

A further chord-diagram model appears for \(r\)-fans of Dyck paths and vacillating tableaux. These objects are highest weight elements of weight zero in crystals of type \(B_r\) and \(C_r\), respectively, and there is an injection into chord diagrams on \([n]\) that intertwines promotion and rotation; the same framework yields a cyclic sieving phenomenon for the promotion action [2212.13588].

The web model for Kreweras words fits the same template. There, promotion is not merely analogous to rotation; it is rotation of the boundary labels on a family of irreducible \(\mathfrak{sl}_3\)-webs, and evacuation is reflection [2005.14031]. Across these settings, the promotion digraph is transported to a geometric rotation digraph, making cycle structure visible in planar terms.

## 6. Encodings by permutations, matrices, and \(m\)-diagrams

Recent work has emphasized explicit encodings of promotion orbits. For rectangular fluctuating tableaux, promotion matrices and promotion permutations provide a canonical permutation-theoretic model. If \(T\) is rectangular of length \(n\), then
\[
\promotion^n(T)=T,
\]
and for each \(i\) the promotion function \(\prom_i(T)\) is a permutation. These satisfy
\[
\prom_i(T)=\prom_{r-i}(T)^{-1},
\]
and under promotion,
\[
\prom_i(\promotion(T))=\sigma^{-|c_1|}\prom_i(T)\sigma^{|c_1|},
\]
with \(\sigma=(1\,2\,\dots\,t)\). Under evacuation,
\[
\prom_i(\evacuation(T))=w_0\prom_i(T)w_0.
\]
Hence promotion acts by conjugation with a long cycle, evacuation by conjugation with the longest element, and the resulting digraph carries an explicit dihedral symmetry [2306.12506].

For rectangular standard Young tableaux, \(m\)-diagrams give a different orbit-length algorithm. The tableau \(T\) determines an \(m\)-diagram \(M_T\), which decomposes into uniform components. Minimal uniformly proper rectangular subtableaux correspond exactly to uniform components of \(M_T\), and promotion preserves these components up to cyclic shift of their boundary labels [2506.22306]. If \(N\) is the rotational symmetry order of the partition of boundary labels coming from the components, and \(\ell\) is the smallest integer for which the promoted component tableaux match after \(N\)-step shifts, then
\[
|O(T)|=\ell N.
\]
This turns orbit-length computation into a decomposition problem on the diagram [2506.22306].

For the minimal orbits in rectangular \(\mathrm{SYT}(m^n)\), the Purbhoo–Rhee bijection already gives a group-theoretic encoding: promotion is right multiplication by a fixed \(n\)-cycle on \(S_n\), so the corresponding sub-digraph is a disjoint union of Cayley-type \(n\)-cycles [1407.0078].

## 7. Extensions, non-bijective variants, and current directions

Promotion digraphs need not always be unions of cycles. Defant and Kravitz’s extended promotion \(\partial\) acts on all labelings of a poset, not only on linear extensions. It agrees with Schützenberger promotion on linear extensions, but is not invertible in general. The resulting digraph is a functional digraph: every vertex has out-degree \(1\), linear extensions form the cyclic core, and directed trees of nonsorted labelings feed into those cycles [2208.08665]. The sorting theorem states that for an \(n\)-element poset,
\[
\partial^{\,n-1}(L)\in L(P)
\]
for every labeling \(L\), so every path enters the linear-extension region after at most \(n-1\) steps [2208.08665].

Other recent generalizations preserve the cycle-union paradigm. For rectangular \(\delta\)-semistandard tableaux, the promotion operators attached to cyclically rotated orientation strings satisfy
\[
\partial_{R^{n-1}(\delta)}\cdots \partial_{R(\delta)}\partial_\delta(T)=T,
\]
and the associated cyclic action exhibits cyclic sieving with the generalized Kostka polynomial [2010.13930]. In rational Catalan combinatorics, promotion on generalized Dyck paths is conjugate to rowmotion, so the promotion digraph and rowmotion digraph are isomorphic after an explicit matching map [2603.17402].

At a more geometric extreme, plabic tangles define promotion maps between products of Grassmannians. These maps form a colored operad under composition, and for several classes of tangles they are quasi-cluster homomorphisms. In that setting, the “promotion digraph” is a network of rational maps between Grassmannians, positroid varieties, and cluster seeds, with composition corresponding to operadic insertion [2508.02891].

Taken together, these developments show that promotion digraphs are not a single construction but a family of tightly related dynamical graphs. In the classical cases they are permutation digraphs with dihedral symmetry; in graph-labeling and rational-Catalan settings they often admit explicit orbit formulas; in diagrammatic realizations they become rotation digraphs on webs, matchings, permutations, and chord diagrams; and in non-bijective extensions they become functional digraphs whose trees record sorting depth rather than cyclic orbit structure [0806.4717].

Source: https://www.emergentmind.com/topics/promotion-digraphs