Related papers: Symbolic powers of multipartite hypergraphs and Wa…

This article investigates under which conditions the symbolic powers of the extension of an ideal is the same as the extension of the symbolic powers. Our result generalizes the known scenarios. As an application, we prove formulas for the…

Let $R=\mathbb{K}[x_1,\dots,x_n]$ and let $\mathfrak{a}_1,\dots,\mathfrak{a}_m$ be homogeneous ideals satisfying certain properties, which include a description of the Noetherian symbolic Rees algebra. We give a solution to a question of…

If ${\cal H}=(V,{\cal E})$ is a hypergraph, its edge intersection hypergraph $EI({\cal H})=(V,{\cal E}^{EI})$ has the edge set ${\cal E}^{EI}=\{e_1 \cap e_2 \ |\ e_1, e_2 \in {\cal E} \ \wedge \ e_1 \neq e_2 \ \wedge \ |e_1 \cap e_2 |\geq…

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…

Let $k$ be a positive integer. We compute depth and Stanley depth of the quotient ring of the edge ideal associated to the $k^{th}$ power of a path on $n$ vertices. We show that both depth and Stanley depth have the same values and can be…

We show that attaching a whisker (or a pendant) at the vertices of a cycle cover of a graph results in a new graph with the following property: all symbolic powers of its cover ideal are Koszul or, equivalently, componentwise linear. This…

Let $D$ be a weighted oriented graph with the underlying graph $G$ and $I(D), I(G) $ be the edge ideals corresponding to $D$ and $G$ respectively. We show that the regularity of edge ideal of a certain class of weighted oriented graph…

The present work is concerned with characterizing some algebraic invariants of edge ideals of hypergraphs. To this aim, firstly, we introduce some kinds of combinatorial invariants similar to matching numbers for hypergraphs. Then we…

We provide a characterisation of all graphs whose parity binomial edge ideals have pure resolutions. In particular, we show that the minimal free resolution of a parity binomial edge ideal is pure if and only if the corresponding graph is a…

Let $G=W(C_{n})$ be a whiskered cycle graph with edge ideal $I=I(G)$. We prove that for every $s\geq 1$, the equality ${\rm reg}(I^{s})=2s+\lceil \frac{n-1}{2}\rceil-1$ holds.

Let $G$ be a cycle or a complete bipartite graph. We show that the binomial edge ideal $J_{G}$ and its initial ideal with respect to the lexicographic order have the same extremal Betti number.

The index of a graded ideal measures the number of linear steps in the graded minimal free resolution of the ideal. In this paper we study the index of powers and squarefree powers of edge ideals. Our results indicate that the index as a…

In this paper we generalize the theorem of Ein-Lazarsfeld-Smith (concerning the behavior of symbolic powers of prime ideals in regular rings finitely generated over a field of characteristic 0) to arbitrary regular rings containing a field.…

In this paper we study ideals of points lying on rational normal curves defined in projective plane and projective $ 3 $-space. We give an explicit formula for the value of Castelnuovo-Mumford regularity for their ordinary powers. Moreover,…

We study the regularity of symbolic powers of square-free monomial ideals. We prove that if $I = I_\Delta$ is the Stanley-Reisner ideal of a simplicial complex $\Delta$, then $\reg(I^{(n)}) \leqslant \delta(n-1) +b$ for all $n\geqslant 1$,…

We introduce the abstract notion of squarefree-power-like functions, which unify the sequences of squarefree ordinary and symbolic powers of squarefree monomial ideals. By employing the Tor-vanishing criteria for mixed sums of ideals, we…

The aim of this work is to derive a symbol calculus on $L^2(\mathbb{R}^n)$ for multidimensional Hausdorff operators. Two aspects of this activity result in two almost independent parts. While throughout the perturbation matrices are…

We determine the arithmetical rank of every edge ideal of a Ferrers graph.

We investigate the occurrence of powers of tight Hamilton cycles in random hypergraphs. For every $r\ge 3$ and $k\ge 1$, we show that there exists a constant $C > 0$ such that if $p=p(n) \ge Cn^{-1/\binom{k+r-2}{r-1}}$ then asymptotically…

A cycle of length $t$ in a hypergraph is an alternating sequence $v_1,e_1,v_2\dots,v_t,e_t$ of distinct vertices $v_i$ and distinct edges $e_i$ so that $\{v_i,v_{i+1}\}\subseteq e_i$ (with $v_{t+1}:=v_1$). Let $\lambda K_n^h$ be the…