Papers
Topics
Authors
Recent
Search
2000 character limit reached

Excited Young Diagrams in Algebraic Combinatorics

Updated 16 January 2026
  • Excited Young diagrams are combinatorial objects defined by iterative local moves on partitions, yielding positive formulas for tableau counts and Hilbert series.
  • They are in bijection with flagged semistandard tableaux, nonintersecting lattice paths, and lozenge tilings, facilitating diverse enumeration methods.
  • They extend to applications in equivariant K-theory and vertex models, connecting algebraic geometry with integrable systems and q-analogues.

An excited Young diagram is a combinatorial object central to formulas for enumerative invariants and structure constants in algebraic combinatorics, representation theory, and algebraic geometry. These diagrams encode the action of local moves (excitations) on a given inner partition within an outer partition or skew shape, providing manifestly positive formulas for standard Young tableau counts, skew Schur specializations, equivariant KK-theory restrictions, and Hilbert series. Excited Young diagrams are in bijection with flagged semistandard tableaux, sets of nonintersecting lattice paths, and lozenge tilings, and have foundational connections to vertex models and integrable systems.

1. Definition and Basic Properties

Let λ\lambda and μ\mu be partitions with μλ\mu \subseteq \lambda, and let Dλ={(i,j)Z>02:1i(λ),1jλi}D_\lambda = \{(i,j)\in\mathbb{Z}_{>0}^2 : 1\le i\le \ell(\lambda), 1\le j\le \lambda_i\} denote the Young diagram of λ\lambda. The skew shape λ/μ\lambda/\mu consists of the boxes in λ\lambda not contained in μ\mu.

An excited Young diagram is any subset CDλC \subseteq D_\lambda obtained by applying a sequence of local moves (excitations) to the "seed" λ\lambda0, subject to the following rules (Panova et al., 2024, Graham et al., 2013, Kirillov et al., 2019):

  • Excited Move: If λ\lambda1 and λ\lambda2, replace λ\lambda3 with λ\lambda4;
  • Moves are iterated, each pushing boxes strictly down and to the right, preserving non-overlap and containment in λ\lambda5.

There exist variants with only Type I moves (removal/replacement), or with Type II moves (addition). The complete set of excited diagrams λ\lambda6 comprises all possible shapes produced via excitations from λ\lambda7 within λ\lambda8.

2. Combinatorial Bijections and Models

Excited Young diagrams admit bijections with several combinatorial families, giving rise to equivalent enumeration and generating formulas (Panova et al., 2024):

  • Flagged Semistandard Tableaux (SSYT): Each excited diagram λ\lambda9 can be encoded by recording, for each original box μ\mu0, the row (after excitations) it occupies; this produces a tableau of shape μ\mu1 and entries subject to flag conditions determined by μ\mu2.
  • Nonintersecting Lattice Paths: The complement μ\mu3 corresponds to a system of nonintersecting up/right lattice paths within μ\mu4, one for each row; these encode the data of the corresponding flagged SSYT.
  • Lozenge Tilings: Each excited diagram indexes a lozenge tiling of a region formed by placing a 3D "ice pile" over μ\mu5 in a box of specified height from μ\mu6.

These bijections are leveraged for enumerative results, such as the skew hook-length formula and weighted counts via Lindström–Gessel–Viennot determinantal methods.

3. Enumeration and Skew Hook-Length Formulas

The enumeration of standard Young tableaux and other symmetrized fillings for skew shapes μ\mu7 is given by summing over excited diagrams (Panova et al., 2024, Kirillov et al., 2019):

μ\mu8

where μ\mu9 is the hook-length of cell μλ\mu \subseteq \lambda0 in μλ\mu \subseteq \lambda1.

Similarly, multivariate formulas emerge:

μλ\mu \subseteq \lambda2

with the μλ\mu \subseteq \lambda3 associated to boundary data of μλ\mu \subseteq \lambda4. Contour integral and vertex-model reformulations exploit algebraic and integrable structures, leading to recursion and determinantal evaluations.

4. Excited Diagrams in Equivariant μλ\mu \subseteq \lambda5-Theory and Hilbert Series

In the setting of equivariant μλ\mu \subseteq \lambda6-theory for Grassmannians and cominuscule varieties (Graham et al., 2013):

  • Schubert varieties μλ\mu \subseteq \lambda7 indexed by permutations or partitions μλ\mu \subseteq \lambda8 admit structure sheaf classes whose restriction to μλ\mu \subseteq \lambda9-fixed points Dλ={(i,j)Z>02:1i(λ),1jλi}D_\lambda = \{(i,j)\in\mathbb{Z}_{>0}^2 : 1\le i\le \ell(\lambda), 1\le j\le \lambda_i\}0 is given as a sum over excited diagrams:

Dλ={(i,j)Z>02:1i(λ),1jλi}D_\lambda = \{(i,j)\in\mathbb{Z}_{>0}^2 : 1\le i\le \ell(\lambda), 1\le j\le \lambda_i\}1

where Dλ={(i,j)Z>02:1i(λ),1jλi}D_\lambda = \{(i,j)\in\mathbb{Z}_{>0}^2 : 1\le i\le \ell(\lambda), 1\le j\le \lambda_i\}2 are torus weights.

  • These formulas are termwise positive, as each factor Dλ={(i,j)Z>02:1i(λ),1jλi}D_\lambda = \{(i,j)\in\mathbb{Z}_{>0}^2 : 1\le i\le \ell(\lambda), 1\le j\le \lambda_i\}3 expands with nonnegative coefficients for positive roots Dλ={(i,j)Z>02:1i(λ),1jλi}D_\lambda = \{(i,j)\in\mathbb{Z}_{>0}^2 : 1\le i\le \ell(\lambda), 1\le j\le \lambda_i\}4, and no cancellations are required.

Hilbert series and polynomials at Dλ={(i,j)Z>02:1i(λ),1jλi}D_\lambda = \{(i,j)\in\mathbb{Z}_{>0}^2 : 1\le i\le \ell(\lambda), 1\le j\le \lambda_i\}5-fixed points are similarly expressed:

Dλ={(i,j)Z>02:1i(λ),1jλi}D_\lambda = \{(i,j)\in\mathbb{Z}_{>0}^2 : 1\le i\le \ell(\lambda), 1\le j\le \lambda_i\}6

Dλ={(i,j)Z>02:1i(λ),1jλi}D_\lambda = \{(i,j)\in\mathbb{Z}_{>0}^2 : 1\le i\le \ell(\lambda), 1\le j\le \lambda_i\}7

where Dλ={(i,j)Z>02:1i(λ),1jλi}D_\lambda = \{(i,j)\in\mathbb{Z}_{>0}^2 : 1\le i\le \ell(\lambda), 1\le j\le \lambda_i\}8 is the number of excited diagrams of size Dλ={(i,j)Z>02:1i(λ),1jλi}D_\lambda = \{(i,j)\in\mathbb{Z}_{>0}^2 : 1\le i\le \ell(\lambda), 1\le j\le \lambda_i\}9.

5. Factorization and λ\lambda0-Analogues

A striking property of formulas involving excited Young diagrams is complete factorization (Kirillov et al., 2019):

  • For the skew hook-content formula:

λ\lambda1

where λ\lambda2 is the content of box λ\lambda3.

  • Likewise, the λ\lambda4-analogues use λ\lambda5-integers λ\lambda6, with:

λ\lambda7

where λ\lambda8 is a rational function in λ\lambda9 with positive coefficients for appropriate shapes.

This factorization reflects the decomposition of the excitation process: from λ/μ\lambda/\mu0 to each λ/μ\lambda/\mu1 yields identical content factors, and from λ/μ\lambda/\mu2 to λ/μ\lambda/\mu3 yields hook-length inverses, with no cross-terms.

6. Vertex Models, Integrability, and Generalizations

Excited diagrams naturally correspond to configurations in six-vertex models (free-fermion point), with Boltzmann weights assigned to vertices and boundary conditions derived from λ/μ\lambda/\mu4 and λ/μ\lambda/\mu5. The Yang–Baxter equation yields Pieri-type recursions, and the correspondence with combinatorial bijections (paths, tableaux, tilings) is exact (Panova et al., 2024).

Contour integral formulas and vertex model interpretations generalize to factorial Grothendieck polynomials, interpolation Macdonald polynomials, spin λ/μ\lambda/\mu6-Whittaker functions, and further symmetric functions. In each case, structure constants and linear extensions recover as weighted sums over excited diagrams or related plane partitions.

7. Open Problems and Positivity Properties

Multiple conjectures and open questions remain (Kirillov et al., 2019):

  • Positivity: For fixed λ/μ\lambda/\mu7, the normalized counts λ/μ\lambda/\mu8 are conjectured to be nonnegative integers.
  • λ/μ\lambda/\mu9-Positivity: Rational λ\lambda0-positivity for λ\lambda1 and λ\lambda2 asserts nonnegativity of coefficients in numerators/denominators of such ratios, with open characterization of shapes for which they are genuine polynomials.
  • Combinatorial Interpretation: Identification of direct combinatorial models corresponding to these normalized quantities remains an open problem, despite the bijections to tableaux and paths for standard tableau counts.

These questions suggest rich connections between excitation-based models, algebraic combinatorics, and representation theory, motivating further research.


Excited Young diagrams thus serve as a unifying object linking enumerative formulas, positivity phenomena, bijections, and integrable systems, with robust applications in algebraic geometry, symmetric function theory, and λ\lambda3-theoretic Schubert calculus (Graham et al., 2013, Panova et al., 2024, Kirillov et al., 2019).

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Excited Young Diagrams.