相关论文: Combinatorial symbolic powers

Given a finite alphabet X and an ordering on the letters, the map \sigma sends each monomial on X to the word that is the ordered product of the letter powers in the monomial. Motivated by a question on Groebner bases, we characterize…

We study the symbolic $F$-splitness of families of binomial edge ideals. We also study the strong $F$-regularity of the symbolic blowup algebras of families of binomial edge ideals. We make use of Fedder-like criteria and combinatorial…

Let $d \geq 2$ and $m\geq 1$ be integers such that $\gcd (d,m)=1.$ Let ${\mathfrak p}$ be the defining ideal of the monomial curve in ${\mathbb A}_{ \Bbbk{k}}^d$ parametrized by $(t^{n_1}, \ldots, t^{n_d})$ where $n_i = d + (i-1)m$ for all…

There is a natural infinite graph whose vertices are the monomial ideals in a polynomial ring. The definition involves Gr\"obner bases or the action of an algebraic torus. We present algorithms for computing the (affine schemes…

In this paper, we investigate when symbolic and ordinary powers of the parity binomial edge ideal of a graph fail to be equal. It turns out that if $\mathcal{I}_{G}$ is the parity binomial edge ideal of a graph $G$, then in each of the…

We present a close relationship between matching number, covering numbers and their fractional versions in combinatorial optimization and ordinary powers, integral closures of powers, and symbolic powers of monomial ideals. This…

Let $G$ be a graph and let $I = I(G)$ be its edge ideal. When $G$ is unicyclic, we give a decomposition of symbolic powers of $I$ in terms of its ordinary powers. This allows us to explicitly compute the Waldschmidt constant and the…

The general normal ordering problem for boson strings is a combinatorial problem. In this note we restrict ourselves to single-mode boson monomials. This problem leads to elegant generalisations of well-known combinatorial numbers, such as…

We introduce binomial edge ideals attached to a simple graph $G$ and study their algebraic properties. We characterize those graphs for which the quadratic generators form a Gr\"obner basis in a lexicographic order induced by a vertex…

We introduce the class of sparse symmetric shifted monomial ideals. These ideals have linear quotients and their Betti numbers are computed. Using this, we prove that the symbolic powers of the generalized star configuration ideal are…

Let $\mathcal{D}$ be a weighted oriented graph and $I(\mathcal{D})$ be its edge ideal. In this paper, we show that all the symbolic and ordinary powers of $I(\mathcal{D})$ coincide when $\mathcal{D}$ is a weighted oriented certain class of…

Let $G$ be a finite simple graph and $J(G)$ denote its vertex cover ideal in a polynomial ring over a field. % $\mathbb{K}$. The $k$-th symbolic power of $J(G)$ is denoted by $J(G)^{(k)}$. In this paper, we give a criteria for cover ideals…

In this paper, we investigate the componentwise linearity and the Castelnuovo-Mumford regularity of symbolic powers of polymatroidal ideals. For a polymatroidal ideal $I$, we conjecture that every symbolic power $I^{(k)}$ is componentwise…

The theory of Rees algebras of monomial ideals has been extensively studied, and as a consequence, many (sometimes partial) equivalences between algebraic properties of monomial ideals, and combinatorial properties of simplicial complexes…

In this paper, we study the componentwise linearity of symbolic powers of edge ideals. We propose the conjecture that all symbolic powers of the edge ideal of a cochordal graph are componentwise linear. This conjecture is verified for some…

We study conditions on polynomials such that the ideal generated by their orbits under the symmetric group action becomes a monomial ideal or has a monomial radical. If the polynomials are homogeneous, we expect that such an ideal has a…

Let $D$ be a weighted oriented graph and $I(D)$ be its edge ideal. If $D$ contains an induced odd cycle of length $2n+1$, under certain condition we show that $ {I(D)}^{(n+1)} \neq {I(D)}^{n+1}$. We give necessary and sufficient condition…

We compute the regularity of powers and symbolic powers of edge ideals of all cubic circulant graphs. In particular, we establish Conjecture of Minh for cubic circulant graphs.

Symmetric strongly shifted ideals are a class of monomial ideals which come equipped with an action of the symmetric group and are analogous to the well-studied class of strongly stable monomial ideals. In this paper we focus on algebraic…

For the edge ideal I of an arbitrary simple graph G we describe the monomials of the saturation of a power of I in terms of (vertex) weighted graphs associated with the monomials. This description allows us to characterize the embedded…