We give conditions for determining the extremal behavior for the (graded) Betti numbers of squarefree monomial ideals. For the case of non-unique minima, we give several conditions which we use to produce infinite families, exponentially growing with dimension, of Hilbert functions which have no smallest (graded) Betti numbers among squarefree monomial ideals and all ideals. For the case of unique minima, we give two families of Hilbert functions, one with exponential and one with linear growth as dimension grows, that have unique minimal Betti numbers among squarefree monomial ideals.
Bresinsky defined a class of monomial curves in $\mathbb{A}^{4}$ with the property that the minimal number of generators or the first Betti number of the defining ideal is unbounded above. We prove that the same behaviour of unboundedness is true for all the Betti numbers and construct an explicit minimal free resolution for this class.
We show that the minimal number of generators and the Cohen-Macaulay type of a family of numerical semigroups generated by concatenation of arithmetic sequences is unbounded.
We consider vector-spread Borel ideals. We show that these ideals have linear quotients and thereby we determine the graded Betti numbers and the bigraded Poincaré series. A characterization of the extremal Betti numbers of such a class of ideals is given. Finally, we classify all Cohen-Macaulay vector-spread Borel ideals.
We construct free resolutions for quotient rings $R/\langle \mathcal{I}', \mathcal{I}\mathcal{J}, \mathcal{J}'\rangle$, give conditions for the quotient to be realized as a fiber product, and give criteria for the construction to be minimal. We then specialize this result to fiber products over a field $k$ and recover explicit formulas for Betti numbers, graded Betti numbers, and Poincaré series.
Let $S=\mathbb{K}[x_1,\ldots,x_n]$ the polynomial ring over a field $\mathbb{K}$. In this paper for some families of monomial ideals $I \subset S$ we study the minimal number of generators of $I^k$. We use this results to find some other Betti numbers of these families of ideals for special choices of $n$, the number of variables.
The main goal of this paper is to size up the minimal graded free resolution of a homogeneous ideal in terms of its generating degrees. By and large, this is too ambitious an objective. As understood, sizing up means looking closely at the two available parameters: the shifts and the Betti numbers. Since, in general, bounds for the shifts can behave quite steeply, we filter the difficulty by the subadditivity of the syzygies. The method we applied is hopefully new and sheds additional light on the structure of the minimal free resolution. We use the Boij-Söderberg techniques for the Betti numb…
We study the extremal Betti numbers of the class of $t$--spread strongly stable ideals. More precisely, we determine the maximal number of admissible extremal Betti numbers for such ideals, and thereby we generalize the known results for $t\in \{1,2\}$.
We express the multigraded Betti numbers of monomial ideals in 4 variables in terms of the multigraded Betti numbers of 66 squarefree monomial ideals, also in 4 variables. We use this class of 66 ideals to prove that monomial resolutions in 4 variables are independent of the base field. In addition, we give a formula for the Betti numbers of an arbitrary monomial ideal in 4 variables.
This paper concerns the study of a class of clutters called simplicial subclutters. Given a clutter $\mathcal{C}$ and its simplicial subclutter $\mathcal{D}$, we compare some algebraic properties and invariants of the ideals $I, J$ associated to these two clutters, respectively. We give a formula for computing the (multi)graded Betti numbers of $J$ in terms of those of $I$ and some combinatorial data about $\mathcal{D}$. As a result, we see that if $\mathcal{C}$ admits a simplicial subclutter, then there exists a monomial $u \notin I$ such that the (multi)graded Betti numbers of $I+(u)$ can be…
We show that Kimura's necessary and sufficient condition for the non-vanishingness of multigraded Betti numbers of chordal graphs can be extended to the wider class of weakly chordal graphs.
We describe an algorithm for finding sharp upper bounds for the total Betti numbers of a saturated ideal given certain constraints on its Hilbert function. This algorithm is implemented in the Macaulay2 package, MaxBettiNumbers, along with variations that produce ideals with maximal total Betti numbers.
Let $I$ be an ideal generated by quadrics in a standard graded polynomial ring $S$ over a field. A question of Avramov, Conca, and Iyengar asks whether the Betti numbers of $R = S/I$ over $S$ can be bounded above by binomial coefficients on the minimal number of generators of $I$ if $R$ is Koszul. This question has been answered affirmatively for Koszul algebras defined by three quadrics and Koszul almost complete intersections with any number of generators. We give a strong affirmative answer to the above question in the case of four quadrics by completely determining the Betti tables of heig…
Let $K$ be a field and $S = K[x_1,\dots,x_n]$ be a polynomial ring over $K$. We discuss the behaviour of the extremal Betti numbers of the class of squarefree strongly stable ideals. More precisely, we give a numerical characterization of the possible extremal Betti numbers (values as well as positions) of such a class of squarefree monomial ideals.
This paper aims to provide several relations between Bass and Betti numbers of a given module and its deficiency modules. Such relations and the tools used throughout allow us to generalize some results of Foxby, characterize Cohen-Macaulay modules in equidimensionality terms and furnish a case for the Auslander-Reiten conjecture.
Motivated by applications to topological data analysis, we give an efficient algorithm for computing a (minimal) presentation of a bigraded $K[x,y]$-module $M$, where $K$ is a field. The algorithm takes as input a short chain complex of free modules $X\xrightarrow{f} Y \xrightarrow{g} Z$ such that $M\cong \ker{g}/\mathrm{im}{f}$. It runs in time $O(|X|^3+|Y|^3+|Z|^3)$ and requires $O(|X|^2+|Y|^2+|Z|^2)$ memory, where $|\cdot |$ denotes the rank. Given the presentation computed by our algorithm, the bigraded Betti numbers of $M$ are readily computed. Our approach is based on a simple matrix red…
We consider the minimal free resolutions of Stanley-Reisner rings associated to linear codes and give an intrinsic characterization of linear codes having a pure resolution. We use this characterization to quickly deduce the minimal free resolutions of Stanley-Reisner rings associated to MDS codes as well as constant weight codes. We also deduce that the minimal free resolutions of Stanley-Reisner rings of first order Reed-Muller codes are pure, and explicitly describe the Betti numbers. Further, we show that in the case of higher order Reed-Muller codes, the minimal free resolutions are almos…
We survey recent results on bounds for Betti numbers of modules over polynomial rings, with an emphasis on lower bounds. Along the way, we give a gentle introduction to free resolutions and Betti numbers, and discuss some of the reasons why one would study these.
