Excited Young Diagrams in Algebraic Combinatorics
- 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 -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 and be partitions with , and let denote the Young diagram of . The skew shape consists of the boxes in not contained in .
An excited Young diagram is any subset obtained by applying a sequence of local moves (excitations) to the "seed" , subject to the following rules (Panova et al., 2024, Graham et al., 2013, Kirillov et al., 2019):
- Excited Move: If and , replace with ;
- Moves are iterated, each pushing boxes strictly down and to the right, preserving non-overlap and containment in .
There exist variants with only Type I moves (removal/replacement), or with Type II moves (addition). The complete set of excited diagrams comprises all possible shapes produced via excitations from within .
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 can be encoded by recording, for each original box , the row (after excitations) it occupies; this produces a tableau of shape and entries subject to flag conditions determined by .
- Nonintersecting Lattice Paths: The complement corresponds to a system of nonintersecting up/right lattice paths within , 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 in a box of specified height from .
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 is given by summing over excited diagrams (Panova et al., 2024, Kirillov et al., 2019):
where is the hook-length of cell in .
Similarly, multivariate formulas emerge:
with the associated to boundary data of . Contour integral and vertex-model reformulations exploit algebraic and integrable structures, leading to recursion and determinantal evaluations.
4. Excited Diagrams in Equivariant -Theory and Hilbert Series
In the setting of equivariant -theory for Grassmannians and cominuscule varieties (Graham et al., 2013):
- Schubert varieties indexed by permutations or partitions admit structure sheaf classes whose restriction to -fixed points is given as a sum over excited diagrams:
where are torus weights.
- These formulas are termwise positive, as each factor expands with nonnegative coefficients for positive roots , and no cancellations are required.
Hilbert series and polynomials at -fixed points are similarly expressed:
where is the number of excited diagrams of size .
5. Factorization and -Analogues
A striking property of formulas involving excited Young diagrams is complete factorization (Kirillov et al., 2019):
- For the skew hook-content formula:
where is the content of box .
- Likewise, the -analogues use -integers , with:
where is a rational function in with positive coefficients for appropriate shapes.
This factorization reflects the decomposition of the excitation process: from to each yields identical content factors, and from to 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 and . 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 -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 , the normalized counts are conjectured to be nonnegative integers.
- -Positivity: Rational -positivity for and 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 -theoretic Schubert calculus (Graham et al., 2013, Panova et al., 2024, Kirillov et al., 2019).