Search arXivSearch

arXiv · 2607.10639

Characteristic Independence of Betti Numbers of Monomial Ideals in Five Variables

Abstract

Alesandroni proved that Betti numbers of monomial ideals in at most four variables are independent of the characteristic of the base field, while characteristic-dependent Betti numbers occur in six variables. We prove that the five-variable case is characteristic-independent. More precisely, if $S=k[x_1,\ldots,x_5]$ and $M\subseteq S$ is a monomial ideal, then the multigraded, graded, and total Betti numbers of $S/M$ are independent of $\operatorname{char}(k)$. The proof reduces arbitrary monomial ideals to squarefree twin ideals and then applies Hochster's formula. The topological input is that simplicial complexes on at most five vertices have torsion-free integral homology. The six-variable example arising from the six-vertex triangulation of $\mathbb{RP}^{2}$ shows that the bound is sharp. We also record a computation of the graded Betti tables of squarefree monomial ideals in five variables up to relabeling.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Noah Ripke, Phillip Yoon. 2026-07-27. Characteristic Independence of Betti Numbers of Monomial Ideals in Five Variables. https://doi.org/10.1016/j.jpaa.2026.108354

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