Related papers: Minimal Reductions and Cores of Edge Ideals

Let $G$ be a graph and $I(G)$ its edge ideal. In this paper, we give a complete characterization of the graphs $G$ for which $\reg(R/I(G)) = 3$.

We prove that, for the edge ideal of a graph whose cycles are pairwise vertex-disjoint, the arithmetical rank is bounded above by the sum of the number of cycles and the maximum height of its associated primes.

We show that any nonzero polynomial in the ideal generated by the $r \times r$ minors of an $n \times n$ matrix $X$ can be used to efficiently approximate the determinant. For any nonzero polynomial $f$ in this ideal, we construct a small…

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…

The zero-divisor graph of a finite commutative ring with unity is the graph whose vertex set is the set of zero-divisors in the ring, with $a$ and $b$ adjacent if $ab=0$. We show that the class of zero-divisor graphs is universal, in the…

An explicit combinatorial minimal free resolution of an arbitrary monomial ideal $I$ in a polynomial ring in $n$ variables over a field of characteristic $0$ is defined canonically, without any choices, using higher-dimensional…

In this paper, we initiate a systematic study of generalized binomial edge ideals of whisker graphs by working within a substantially broader class of graphs. We extend the notion of generalized corona products, and through this enlarged…

We study the linkage classes of homogeneous ideals in polynomial rings. An ideal is said to be homogeneously licci if it can be linked to a complete intersection using only homogeneous regular sequences at each step. We ask a natural…

The regular graph of ideals of the commutative ring $R$, denoted by ${\Gamma_{reg}}(R)$, is a graph whose vertex set is the set of all non-trivial ideals of $R$ and two distinct vertices $I$ and $J$ are adjacent if and only if either $I$…

We consider the family of graphs whose vertex set is $\mathbb{Z}^n$ where two vertices are connected by an edge when their $\ell_\infty$-distance is 1. Towards an edge isoperimetric inequality for this graph, we calculate the edge boundary…

Minimum spanning trees are important tools in the analysis and design of networks. Many practical applications require their computation, ranging from biology and linguistics to economy and telecommunications. The set of cycles of a network…

The core of an ideal is the intersection of all of its reductions. The core has geometric significance coming, for example, from its connection to adjoint and multiplier ideals. In general, though, the core is difficult to describe…

Let P = k[x_1, ..., x_n] be the polynomial ring in n variables. A homogeneous ideal I of P generated in degree d is called Gotzmann if it has the smallest possible Hilbert function out of all homogeneous ideals with the same dimension in…

Let $(S, \mathfrak n) $ be a regular local ring and let $I \subseteq \mathfrak n^2 $ be a perfect ideal of $S. $ Sharp upper bounds on the minimal number of generators of $I$ are known in terms of the Hilbert function of $R=S/I. $ Starting…

We address a specific case of the matroid intersection problem: given a set of graphs sharing the same set of vertices, select a minimum cycle basis for each graph to maximize the size of their intersection. We provide a comprehensive…

We study rational normal curves via a connection to the chip firing game. A key technique, introduced in this article, is to interpret the defining ideal of the rational normal curve as an ideal associated to a generalisation of a cycle…

Let $S=K[x_1, \ldots,x_n]$ denote the polynomial ring in $n$ variables over a field $K$ and let $I \subset S$ be a monomial ideal. For a vector $\mathfrak{c}\in\mathbb{N}^n$, we set $I_{\mathfrak{c}}$ to be the ideal generated by monomials…

We prove a generalized version of Evans and Griffith's Improved New Intersection Theorem: Let I be an ideal in a local ring R. If a finite free R-complex, concentrated in nonnegative degrees, has I-torsion homology in positive degrees, and…

This paper develops a fundamental theory of realizations of linear and group codes on general graphs using elementary group theory, including basic group duality theory. Principal new and extended results include: normal realization…

We study the minimal homogeneous generating sets of the Eulerian ideal associated with a simple graph and its maximal generating degree. We show that the Eulerian ideal is a lattice ideal and use this to give a characterization of binomials…