Ladder Determinantal Module
- Ladder determinantal modules are finite direct sums of determinantal ideals defined by ladder-shaped minors in a generic matrix, fundamental for studying algebraic invariants.
- They use combinatorial interval data to compute invariants such as Castelnuovo–Mumford regularity, multiplicity, and Gorenstein criteria via tableau and lattice-theoretic methods.
- Applications extend to representation theory and Rees algebra constructions, offering a versatile framework for analyzing module classifications and homological behaviors.
A ladder determinantal module is a module-theoretic object associated with the ideal theory of minors of “ladder-shaped” submatrices in a generic matrix of indeterminates. Originally developed in the context of commutative algebra and algebraic geometry, the concept encompasses both module-theoretic and representation-theoretic variants, but in contemporary commutative algebra, it precisely refers to a finite direct sum of determinantal ideals generated by fixed-size minors in generalized (often two-sided) ladder matrices. The ladder determinantal module provides a robust framework for the study of algebraic invariants (e.g., divisor class groups, semidualizing modules, Rees and special fiber rings, Castelnuovo–Mumford regularity, and Gorenstein property) in settings that interpolate between classical determinantal rings and more flexible combinatorial configurations of minors.
1. Formulation and Construction
Let be a normal domain, and an matrix of indeterminates over . A subset is a -ladder if whenever with and , then and 0 are also in 1. Minimality is imposed: every row and column of 2 is nonempty. The polynomial ring 3 is graded by degree in the variables corresponding to 4, and the ladder determinantal ideal 5 is generated by all 6 minors supported on the ladder submatrix of 7. The ladder determinantal ring is then
8
A ladder determinantal module is defined as a direct sum 9 of copies of the ideal 0, where 1 is a ladder-shaped submatrix defined by intervals 2 for each row 3. Each summand is generated by maximal minors of 4, and 5 inherits a natural module and grading structure (Sather-Wagstaff et al., 2020, Fouli et al., 20 Jan 2026, Costantini et al., 29 Jul 2025).
2. Combinatorial Data and Decomposition
The combinatorial essence of a ladder determinantal module is encoded in interval data of the ladder: 6 with strict inequalities 7, 8, and 9. The associated parameters are:
- 0, reflecting the width of the 1th nonzero row block;
- 2, measuring the horizontal overlap between adjacent rows.
These parameters completely determine the algebraic invariants of 3 and its associated algebras. Disconnected ladders decompose as unions of (t-)connected blocks, each handled independently in various invariants computations, leading to product decompositions in divisor class groups and module classifications (Sather-Wagstaff et al., 2020, Costantini et al., 29 Jul 2025).
3. Algebraic Invariants and Gorenstein Criteria
Associated to any ladder determinantal module 4, the special fiber ring
5
has dimension
6
The Castelnuovo–Mumford regularity is given by
7
where 8 is determined from maximal chains in an associated combinatorial graph. The 9-invariant is
0
The multiplicity reduces to the number of standard skew Young tableaux of a certain combinatorially defined shape 1, itself a function of 2 and 3 (Costantini et al., 29 Jul 2025).
For special fiber rings of ladder determinantal modules, the Gorenstein property is characterized by the purity of a corresponding join-irreducible poset in a Hibi (toric) degeneration. Necessary and sufficient conditions for Gorensteinness are given directly in terms of the combinatorial data 4, 5 (6), and 7, as articulated in:
- For all 8, 9;
- For all 0, 1;
- 2, where 3 is the minimum 4 with 5 (Fouli et al., 20 Jan 2026).
These modular combinatorial criteria reduce, in the generic case, to classical determinantal Gorenstein criteria and extend to all connected ladder shapes.
4. Divisor Class Groups and Semidualizing Module Classification
For 6 over a normal domain 7, the divisor class group splits as
8
where 9 and 0 is the field of fractions of 1. The group 2 is a finitely generated free abelian group determined by the combinatorics of 3.
The main theorem for the classification of semidualizing modules over 4 asserts
5
and if 6 has 7 non-Gorenstein blocks, then
8
Every semidualizing module is of form 9 with 0 and 1 determined by the non-Gorenstein components of the ladder. In particular, for one-sided ladders or Gorenstein blocks, only the trivial and canonical semidualizing modules exist. For ladders with more non-Gorenstein components, the set of semidualizing modules forms a Boolean algebra whose rank counts these components (Sather-Wagstaff et al., 2020, Sather-Wagstaff et al., 2018, Sather-Wagstaff et al., 2018).
5. Rees Algebras, Toric Degenerations, and Homological Properties
The full multi-Rees algebra associated to direct sums of ladder determinantal ideals has a presentation ideal generated by Eagon–Northcott syzygies and Plücker-type quadrics. Under a well-chosen term order, the initial ideal is squarefree quadratic, placing the Rees and special fiber algebras in the class of Koszul, Cohen–Macaulay, normal domains. SAGBI degeneration techniques show that these rings deform flatly to Hibi rings of distributive lattices 2, preserving key invariants and even strong 3-regularity in positive characteristic or rational singularities in characteristic zero (Lin et al., 2024). This structure underlies both the explicit computation of algebraic invariants and the effective analysis of homological behavior and syzygies.
6. Connections to Regularity, Tableaux Combinatorics, and Schubert Varieties
Combinatorial formulas for the invariants, especially regularity and multiplicity, are grounded in Young tableau and lattice-theoretic statistics:
- For one-sided mixed ladder determinantal ideals, the Castelnuovo–Mumford regularity of the coordinate ring is computed as the sum of the sizes of the largest antidiagonals in certain combinatorially defined subsets (e.g., 4), closely related to vexillary Grothendieck polynomials indexed by permutations associated to the ladder (Rajchgot et al., 2022).
- The multiplicity in the 5 case equals the number of standard skew Young tableaux of the associated skew shape 6, given by an explicit excited-diagram/hook-length formula (Costantini et al., 29 Jul 2025).
Applications include corrections to previous conjectures regarding the regularity of Kazhdan–Lusztig ideals and a unified tableau-theoretic interpretation of algebraic degrees across a broad class of ladder-like determinantal varieties.
7. Representation-Theoretic Ladder Modules
In the representation theory of the graded affine Hecke algebra, a ladder determinantal module also refers to the “ladder representation” associated to a sequence of segments (intervals) 7, ordered so that 8 and 9. The unique irreducible quotient of the induced module from these segments has a character given by an explicit determinantal sum over the symmetric group. The connection to the BGG resolution and Arakawa–Suzuki functor ensures that these modules are semisimple and unitary with respect to natural Hermitian forms and are closely related, via translation functors, to the structure theory of ladder determinantal rings and their algebraic invariants (Barbasch et al., 2014).
References:
- "Ladder determinantal rings over normal domains" (Sather-Wagstaff et al., 2020)
- "Gorenstein Special Fiber Rings of Ladder Determinantal Modules" (Fouli et al., 20 Jan 2026)
- "Algebraic invariants of the special fiber ring of ladder determinantal modules" (Costantini et al., 29 Jul 2025)
- "Blowup algebras of ladder or interval determinantal modules" (Lin et al., 2024)
- "Castelnuovo-Mumford regularity of ladder determinantal varieties and patches of Grassmannian Schubert varieties" (Rajchgot et al., 2022)
- "Ladder representations of GL(n,Q_p)" (Barbasch et al., 2014)
- "Semidualizing modules of 0 ladder determinantal rings" (Sather-Wagstaff et al., 2018)
- "On semidualizing modules of ladder determinantal rings" (Sather-Wagstaff et al., 2018)