Related papers: Divisors on graphs, orientations, syzygies, and sy…
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…
We introduce a persistent commutative algebra for studying the algebraic and combinatorial evolution of edge ideals of graphs and hypergraphs under filtration. Building on the Persistent Stanley--Reisner Theory (PSRT), we develop the notion…
To a matroid M with n edges, we associate the so-called facet ideal F(M) generated by monomials corresponding to bases of M. We show that the Betti numbers related to an N-graded minimal free resolution of F(M) are determined by the Betti…
We focus in this paper on edge ideals associated to bipartite graphs and give a combinatorial characterization of those having regularity 3. When the regularity is strictly bigger than 3, we determine the first step $i$ in the minimal…
We show that the minimal free resolution of a general semi-stable sheaf $U$ on $\mathbb{P}^2$ contains a subcomplex that determines an extremal ray of the cone of effective divisors of its moduli space. We provide evidence that this is part…
In the present paper, we consider upper bounds of higher linear syzygies i.e. graded Betti numbers in the first linear strand of the minimal free resolutions of projective varieties in arbitrary characteristic. For this purpose, we first…
The hyperbolicity of a graph, informally, measures how close a graph is (metrically) to a tree. Hence, it is intuitively similar to treewidth, but the measures are formally incomparable. Motivated by the broad study of algorithms and…
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 prove a duality theorem for simplicial complexes arising from a combinatorial construction we define, which applies to the squarefree monomial complexes for Veronese ideals of projective spaces and weighted projective spaces. Our theorem…
The problem of covering the ground set of two matroids by a minimum number of common independent sets is notoriously hard even in very restricted settings, i.e.\ when the goal is to decide if two common independent sets suffice or not.…
Well ordered covers of square-free monomial ideals are subsets of the minimal generating set ordered in a certain way that give rise to a Lyubeznik resolution for the ideal, and have guaranteed nonvanishing Betti numbers in certain degrees.…
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…
A fruitful contemporary paradigm in graph theory is that almost all graphs that do not contain a certain subgraph have common structural characteristics. The "almost" is crucial, without it there is no structure. In this paper we transfer…
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…
Matroids and semigraphoids are discrete structures abstracting and generalizing linear independence among vectors and conditional independence among random variables, respectively. Despite the different nature of conditional independence…
Let $G$ be a finite simple graph on $n$ vertices. Let $J_G \subset K[x_1, \ldots, x_n]$ be the cover ideal of $G$. In this article, we obtain syzygies, Betti numbers and Castelnuovo-Mumford regularity of $J_G^s$ for all $s \geq 1$ for…
Over an infinite field $K$, we investigate the minimal free resolution of some configurations of lines. We explicitly describe the minimal free resolution of "complete grids of lines" and obtain an analogous result about the so-called…
We characterize componentwise linear monomial ideals with minimal Taylor resolution and consider the lower bound for the Betti numbers of componentwise linear ideals.
The problem of finding generators of the $GL$-ideal of the relations between the generators of the algebra of invariants of the dihedral group acting on $m$-tuples of vectors from its defining $2$-dimensional representation is studied. It…
We investigate, using the notion of linear quotients, significative classes of connected graphs whose monomial edge ideals, not necessarily squarefree, have linear resolution, in order to compute standard algebraic invariants of the…