Search arXivSearch

arXiv · 2507.22167

Algebraic invariants of the special fiber ring of ladder determinantal modules

Abstract

We provide explicit formulas for key invariants of special fiber rings of ladder determinantal modules, that is, modules that are direct sums of ideals of maximal minors of a ladder matrix. Our results are given in terms of the combinatorial data of the associated ladder matrix. In particular, we compute its dimension, regularity, $a$-invariant, and multiplicity, which via \textsc{Sagbi} degeneration coincide with those of Hibi rings associated to a distributive lattice. Then, via Gröbner degeneration these calculations are reduced to quotients of polynomial rings by monomial ideals. Our formula for the multiplicity of the special fiber ring of these ladder determinantal modules is obtained by counting the number of standard skew Young tableaux associated to a certain skew partition, and so provides a natural generalization of the classical formula for the degree of the Grassmannian.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alessandra Costantini, Louiza Fouli, Kriti Goel, Kuei-Nuan Lin, Haydee Lindo, Whitney Liske, Maral Mostafazadehfard. 2025-07-29. Algebraic invariants of the special fiber ring of ladder determinantal modules. https://arxiv.org/abs/2507.22167

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

KEEP EXPLORING

Related papers

Generalized Additive Decompositions of Symmetric Tensors

This article addresses the Generalized Additive Decomposition (GAD) of symmetric tensors, that is, degree-$d$ forms $f \in \mathcal{S}_d$. From a geometric perspective, a GAD corresponds to representing a point on a secant of osculating varieties to the Veronese variety, providing a compact and structured description of a tensor that captures its intrinsic algebraic properties. We provide a linear algebra method for measuring the GAD size and prove that the minimal achievable size, which we call the GAD-rank of the considered tensor, coincides with the rank of suitable Catalecticant matrices, under certain regularity assumptions. We provide a new explicit description of the apolar scheme associated with a GAD as the annihilator of a polynomial-exponential series. We show that if the Castelnuovo-Mumford regularity of this scheme is sufficiently small, then both the GAD and the associated apolar scheme are minimal and unique. Leveraging these results, we develop a numerical GAD algorithm for symmetric tensors that effectively exploits the underlying algebraic structure, extending existing algebraic approaches based on eigen computation to the treatment of multiple points. We illustrate the effectiveness and numerical stability of such an algorithm through several examples, including Waring and tangential decompositions.

math.AC

Numerical Semigroups of Sally Type II

In this paper we study numerical semigroups of Sally type of multiplicity $e$ and embedding dimension $ν\ge e-2$. We construct the minimal resolutions for these semigroup rings when they are symmetric and compute their Betti numbers. We also construct a minimal resolution for another special class of such semigroups of type $ν-1$. Finally, we propose some conjectures for the Betti numbers of families of non-symmetric Sally type semigroups in the above cases in relation to those of the corresponding Gorenstein cases of Sally type semigroups.

math.AC

Matrix equivalence to Smith normal form: new theoretical results for multivariate polynomial matrices

This paper investigates the Smith normal form equivalence problem for multivariate polynomial matrices. Using methods from matrix theory and polynomial ideal theory, we prove that Frost and Storey's 1978 conjecture holds for a broad class of matrices: such a matrix is equivalent to its Smith normal form if and only if its reduced minors of each order generate the unit ideal. Moreover, by extending the original matrix class via automorphisms of the polynomial ring, we show that our framework applies in a substantially more general setting.

math.AC