Regular sequences of linear forms on monomial ideals
Abstract
In this paper we establish a means of using the combinatorics associated to a general monomial ideal I in a polynomial ring R to find a regular sequence of linear forms on R/I. The sequence of linear forms provides an effective lower bound on depth(R/I). When I is the edge ideal of a graph, we provide conditions under which this bound is an equality, allowing the realization of the depth via a regular sequence of linear polynomials. In addition, we explicitly describe the minimal primes of (I, f1, …, fq), when f1, …, fq are homogeneous polynomials of degree one with pairwise disjoint support and I is any monomial ideal. Finally, we propose a conjecture on the form of all associated primes of the ideal (I, f1, …, fq), when I is the edge ideal of a graph and fi are disjoint stars on I.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.