Related papers: Trimming Complexes and Applications to Resolutions…
We present two new problems on lower bounds for resolution Betti numbers of monomial ideals generated in a fixed degree. The first concerns any such ideal and bounds the total Betti numbers, while the second concerns ideals that are…
Cut ideals, introduced by Sturmfels and Sullivant, are used in phylogenetics and algebraic statistics. We study the minimal free resolutions of cut ideals of tree graphs. By employing basic methods from topological combinatorics, we obtain…
Let $R = k[x_1, \dotsc , x_n]$ denote the standard graded polynomial ring over a field $k$. We study certain classes of equigenerated monomial ideals with the property that the so-called complementary ideal has no linear relations on the…
We provide a new combinatorial approach to study the minimal free resolutions of edge ideals, that is, quadratic square-free monomial ideals. With this method we can recover most of the known results on resolutions of edge ideals with…
Let $X$ be an $(m\times n)$-matrix of indeterminates, and let $J$ be the ideal generated by a set $\mathcal{S}$ of maximal minors of $X$. We construct the linear strand of the resolution of $J$. This linear strand is determined by the…
We consider ideals generated by general sets of $m$-minors of an $m\times n$-matrix of indeterminates. The generators are identified with the facets of an $(m-1)$-dimensional pure simplicial complex. The ideal generated by the minors…
We explore a family of monomial ideals derived as Gr\"obner degenerations of determinantal ideals. These ideals, previously examined as block diagonal matching field ideals within the realm of toric degenerations of Grassmannians, are…
A sparse generic matrix is a matrix whose entries are distinct variables and zeros. Such matrices were studied by Giusti and Merle who computed some invariants of their ideals of maximal minors. In this paper we extend these results by…
This paper is concerned with finding bounds on betti numbers and describing combinatorially and topologically (minimal) free resolutions of powers of ideals generated by a fixed number $q$ of square-free monomials. Among such ideals, we…
We provide some new conditions under which the graded Betti numbers of a monomial ideal can be computed in terms of the graded Betti numbers of smaller ideals, thus complementing Eliahou and Kervaire's splitting approach. As applications,…
A determinantal facet ideal (DFI) is generated by a subset of the maximal minors of a generic $n\times m$ matrix where $n\leq m$ indexed by the facets of a simplicial complex $\Delta$. We consider the more general notion of an $r$-DFI,…
In this thesis we investigate certain types of monomial ideals of polynomial rings over fields. We are interested in minimal free resolutions of these ideals (or equivalently the quotients of the polynomial ring by the ideals) considered as…
It is known that the chain complex of a simplex on $q$ vertices can be used to construct a free resolution of any ideal generated by $q$ monomials, and as a direct result, the Betti numbers always have binomial upper bounds, given by the…
We consider determinantal ideals, where the generating minors are encoded in a hypergraph. We study when the generating minors form a Gr\"obner basis. In this case, the ideal is radical, and we can describe algebraic and numerical…
There are two seemingly unrelated ideals associated with a simplicial complex \Delta. One is the Stanley-Reisner ideal I_\Delta, the monomial ideal generated by minimal non-faces of \Delta, well-known in combinatorial commutative algebra.…
Let $(R,\mathfrak{m},\Bbbk)$ be a regular local ring of dimension 3. Let $I$ be a Gorenstein ideal of $R$ of grade 3. It follows from a result of Buchsbaum and Eisenbud that there is a skew-symmetric matrix of odd size such that $I$ is…
We study a family of monomial ideals, called block diagonal matching field ideals, which arise as monomial Gr\"obner degenerations of determinantal ideals. Our focus is on the minimal free resolutions of these ideals and all of their…
We compute the primary decomposition of certain ideals generated by subsets of minors in a generic matrix or in a generic symmetric matrix, or subsets of Pfaffians in a generic skew-symmetric matrix. Specifically, the ideals we consider are…
In this paper we develop a new technique to compute the Betti table of a monomial ideal. We present a prototype implementation of the resulting algorithm and we perform numerical experiments suggesting a very promising efficiency. On the…
The Taylor resolution is almost never minimal for powers of monomial ideals, even in the square-free case. In this paper we introduce a smaller resolution for each power of any square-free monomial ideal, which depends only on the number of…