Related papers: Betti numbers of transversal monomial ideals

Let $S$ be a polynomial algebra over a field. We study classes of monomial ideals (as for example lexsegment ideals) of $S$ having minimal depth. In particular, Stanley's conjecture holds for these ideals. Also we show that if Stanley's…

We construct the minimal resolutions of three classes of monomial ideals: dominant, 1-semidominant, and 2-semidominant ideals. The families of dominant and 1-semidominant ideals extend those of complete and almost complete intersections. We…

Let $G$ be a simple graph on the vertex set $[n]$ and $J_G$ be the corresponding binomial edge ideal. Let $G=v*H$ be the cone of $v$ on $H$. In this article, we compute all the Betti numbers of $J_G$ in terms of Betti number of $J_H$ and as…

Nearly complete intersection ideals were introduced by A. Boocher and J. Seiner (2018) and defines a special class of monomial ideals in a polynomial ring. These ideals were used to give a lower bound of the total sum of betti numbers that…

In this paper we investigate the question of normality for special monomial ideals in a polynomial ring over a field. We first include some expository sections that give the basics on the integral closure of a ideal, the Rees algebra on an…

We study when Taylor resolutions of monomial ideals are minimal. We consider monomial ideals with linear quotients. In particular, we determine precisely the stable ideals and the monomial ideals with linear resolutions having the miminal…

The main goal of this paper is to prove, in positive characteristic $p$, stability behavior for the graded Betti numbers in the periodic tails of the minimal resolutions of Frobenius powers of the homogeneous maximal ideals for very general…

A celebrated theorem of Fr\"oberg gives a complete combinatorial classification of quadratic square-free monomial ideals with a linear resolution. A generalization of this theorem to higher degree square-free monomial ideals is an active…

All matrices we consider have entries in a fixed algebraically closed field $K$. A minor of a square matrix is principal means it is defined by the same row and column indices. We study the ideal generated by size $t$ principal minors of a…

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…

Motivated by using combinatorics to study jets of monomial ideals, we extend a definition of jets from graphs to clutters. We offer some structural results on their vertex covers, and show an interesting connection between the cover ideal…

Let $G$ be a cycle or a complete bipartite graph. We show that the binomial edge ideal $J_{G}$ and its initial ideal with respect to the lexicographic order have the same extremal Betti number.

This paper describes and analyzes a method for computing border bases of a zero-dimensional ideal $I$. The criterion used in the computation involves specific commutation polynomials and leads to an algorithm and an implementation extending…

To a simplicial complex, we associate a square-free monomial ideal in the polynomial ring generated by its vertex set over a field. We study algebraic properties of this ideal via combinatorial properties of the simplicial complex. By…

We show that the ideal generated by the $(n-2)$ minors of a general symmetric $n$ by $n$ matrix has an initial ideal that is the Stanley-Reisner ideal of the boundary complex of a simplicial polytope and has the same Betti numbers.

Castelnuovo-Mumford regularity is a measure of algebraic complexity of an ideal. Regularity of monomial ideals can be investigated combinatorially. We use a simple graph decomposition and results from structural graph theory to prove,…

Let $\mathbb{K}$ be a field and $S=\mathbb{K}[x_1,\dots,x_n]$ be the polynomial ring in $n$ variables over the field $\mathbb{K}$. Suppose that $\mathcal{C}$ is a chordal clutter with $n$ vertices and assume that the minimum edge…

We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…

We provide a simple method to compute the Betti numbers if the Stanley-Reisner ideal of a simplicial tree and its Alexander dual.

Let S be a polynomial algebra over a field. If I is the edge ideal of a perfect semiregular tree, then we give precise formulas for values of depth, Stanley depth, projective dimension, regularity and Krull dimension of S/I.