相关论文: Combinatorial symbolic powers

To compute the local cohomology of powers of edge ideals one needs to know their saturations. The saturation of the second and third powers has been described in terms of the graph in [13] and [10]. In this article, we give a combinatorial…

There are two different notions for symbolic powers of ideals existing in the literature, one defined in terms of associated primes, the other in terms of minimal primes. Elaborating on an idea known to Eisenbud, Herzog, Hibi, and Trung, we…

We survey old and new approaches to the study of symbolic powers of ideals. Our focus is on the symbolic Rees algebra of an ideal, viewed both as a tool to investigate its symbolic powers and as a source of challenging problems in its own…

By an easy application of Skoda's theorem on ideal generation, a non-local version of the Briancon-Skoda theorem is obtained. In particular, the symbolic powers $I^{(p)}$ of a zero dimensional radical ideal $I$ generated by $r$ holomorphic…

Let $I$ be the ideal generated by the maximal minors of a matrix of indeterminates over a field and let $J$ denote the generic link, i.e., the most general link, of $I$. The generators of the ideal $J$ are not known. We provide an explicit…

We characterize symbolic powers of prime ideals in polynomial rings over any field in terms of $\mathbb{Z}$-linear differential operators, and of prime ideals in polynomial rings over complete discrete valuation rings with a $p$-derivation…

Let $R$ be a commutative Noetherian ring and let ${\bf x} :=x_1,\ldots,x_d$ be a regular $R$-sequence contained in the Jacobson radical of $R$. An ideal $I$ of $R$ is said to be a monomial ideal with respect to ${\bf x}$ if it is generated…

We present criteria for the Cohen-Macaulayness of a monomial ideal in terms of its primary decomposition. These criteria allow us to use tools of graph theory and of linear programming to study the Cohen-Macaulayness of monomial ideals…

In a polynomial ring over a perfect field, the symbolic powers of a prime ideal can be described via differential operators: a classical result by Zariski and Nagata says that the $n$-th symbolic power of a given prime ideal consists of the…

Let $S$ be a Cohen-Macaulay ring which is local or standard graded over a field, and let $I$ be an unmixed ideal that is also generically a complete intersection. Our goal in this paper is multi-fold. First, we give a multiplicity-based…

Given a monomial ideal $I$, we study two functions that quantify ways to measure the difference between symbolic powers and usual powers of $I$. In many cases we determine the asymptotic growth rate of these two functions. We also perform…

We prove that the integral closures of the powers of a squarefree monomial ideal I equal the symbolic powers if and only if I is the edge ideal of a Fulkersonian hypergraph.

We introduce the concept of matching powers of monomial ideals. Let $I$ be a monomial ideal of $S=K[x_1,\dots,x_n]$, with $K$ a field. The $k$th matching power of $I$ is the monomial ideal $I^{[k]}$ generated by the products $u_1\cdots u_k$…

In this paper we would like to introduce some new methods for studying magic type-colorings of graphs or domination of graphs, based on combinatorial spectrum on polynomial rings. We hope that this concept will be potentially useful for the…

In this paper, we provide a unified definition of mediated graph, a combinatorial structure with multiple applications in mathematical optimization. We study some geometric and algebraic properties of this family of graphs and analyze…

In combinatorial commutative algebra and algebraic statistics many toric ideals are constructed from graphs. Keeping the categorical structure of graphs in mind we give previous results a more functorial context and generalize them by…

Let $I_X$ be the saturated homogeneous ideal defining a codimension two arithmetically Cohen-Macaulay scheme $X \subseteq \mathbb{P}^n$, and let $I_X^{(m)}$ denote its $m$-th symbolic power. We are interested in when $I_X^{(m)} = I_X^m$. We…

In the context of algebraic statistics an experimental design is described by a set of polynomials called the design ideal. This, in turn, is generated by finite sets of polynomials. Two types of generating sets are mostly used in the…

We study almost complete intersection ideals in a polynomial ring, generated by powers of all the variables together with a power of their sum. Our main result is an explicit description of the reduced Gr\"obner bases for these ideals under…

This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr\"obner basis can be computed by…