中文
相关论文

相关论文: Edge ideals and their asymptotic syzygies

200 篇论文

Let $G$ be a unicyclic graph with edge ideal $I(G)$. For any integer $s\geq 1$, we denote the $s$-th symbolic power of $I(G)$ by $I(G)^{(s)}$. It is shown that ${\rm reg}(I(G)^{(s)})={\rm reg}(I(G)^s)$, for every $s\geq 1$.

交换代数 · 数学 2019-03-27 S. A. Seyed Fakhari

We introduce a unified framework for studying persistence phenomena in commutative algebra via filtrations of ideals. For a filtration $\mathcal{F} = \{I_i\}_{i \in \mathbb{N}}$, we define $\mathcal{F}$-persistence and $\mathcal{F}$-strong…

交换代数 · 数学 2026-01-21 Mehrdad Nasernejad , Jonathan Toledo

Let $R$ be a finite commutative ring with identity, and let $P$ be a proper prime ideal of $R$. The prime ideal graph $\Gamma_P(R)$ has vertex set of $R\setminus\{0\}$, where two distinct vertices $x$ and $y$ are adjacent if and only if…

交换代数 · 数学 2026-05-14 Tabinda Rasheed , Wang Yao

We introduce a persistent commutative algebra for studying the algebraic and combinatorial evolution of edge ideals of graphs and hypergraphs under filtration. Building on the Persistent Stanley--Reisner Theory (PSRT), we develop the notion…

交换代数 · 数学 2025-12-22 Faisal Suwayyid , Guo-Wei Wei

In this paper, we study the componentwise linearity of powers of edge ideal of a weighted oriented graph $D$. We give a characterization for componentwise linearity of the edge ideal $I(D)$ in terms of forbidden subgraphs of $D$. If $D$ is…

交换代数 · 数学 2025-09-19 Manohar Kumar , Joydip Mondal , Ramakrishna Nanduri

We introduce the concept of minimum edge cover for an induced subgraph in a graph. Let $G$ be a unicyclic graph with a unique odd cycle and $I=I(G)$ be its edge ideal. We compute the exact values of all symbolic defects of $I$ using the…

交换代数 · 数学 2022-04-13 Mousumi Mandal , Dipak Kumar Pradhan

In this paper, we consider homological properties of so-called graph ideals. Consider $\Gamma$ is a graph with vertices $t_1$, ..., $t_s$, without self-loops and multiple adjacencies. We can associate with such a graph an ideal…

逻辑 · 数学 2019-08-29 Evgeny S. Golod , Georgy A. Osipov

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…

组合数学 · 数学 2022-04-12 Mousumi Mandal , Dipak Kumar Pradhan

An ideal $I$ of a commutative ring $R$ is said to be of linear type when its Rees algebra and symmetric algebra exhibit isomorphism. In this paper, we investigate the conjecture put forth by Jayanthan, Kumar, and Sarkar (2021) that if $G$…

交换代数 · 数学 2025-05-06 Marie Amalore Nambi , Neeraj Kumar

Let $G$ be a simple graph and $I(G)$ be its edge ideal. In this article, we study the Castelnuovo-Mumford regularity of symbolic powers of edge ideals of join of graphs. As a consequence, we prove Minh's conjecture for wheel graphs,…

交换代数 · 数学 2020-08-04 Arvind Kumar , Rajiv Kumar , Rajib Sarkar

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…

交换代数 · 数学 2014-12-01 Ha Thi Thu Hien , Ha Minh Lam , Ngo Viet Trung

In this paper we investigate the Rees algebras of squarefree monomial ideals $I \subset S=K[x_1,\dots,x_n]$ generated in degree $n-2$, where $K$ is a field. Every such ideal arises as the complementary edge ideal $I_c(G)$ of a finite simple…

交换代数 · 数学 2025-09-24 Antonino Ficarra , Somayeh Moradi

We show that if $G$ is a gap-free and diamond-free graph, then $I(G)^s$ has a linear minimal free resolution for every $s\geq 2$.

交换代数 · 数学 2020-03-03 Nursel Erey

We prove that second and higher powers of the edge ideals of anticycles admit linear quotient orderings, although the edge ideals themselves do not, thus resolving an open question of Hoefel and Whieldon in the affirmative and providing the…

交换代数 · 数学 2025-06-19 Etan Basser , Rachel Diethorn , Robert Miranda , Mario Stinson-Maas

Let G be a graph and let I = I(G) be its edge ideal. In this paper, when G is a forest or a cycle, we explicitly compute the regularity of I^s for all s > 0. In particular, for these classes of graphs, we provide the asymptotic linear…

交换代数 · 数学 2022-09-30 Selvi Kara , Huy Tai Ha , Tran Nam Trung

Let (P,<) be a finite poset and let G be its comparability graph. If cl(G) is the clutter of maximal cliques of G, we prove that cl(G) satisfies the max-flow min-cut property and that its edge ideal is normally torsion free. We prove that…

交换代数 · 数学 2011-04-05 Luis A. Dupont , Rafael H Villarreal

The main focus of these notes is recent work on linear systems in which line arrangements play a role, including problems such as semi-effectivity, containment problems of symbolic powers of homogeneous ideals in their powers, bounded…

代数几何 · 数学 2017-05-30 Brian Harbourne

A monomial ideal $I\subseteq \mathbb{K}[x_1,\ldots , x_n]$ is called a Simis ideal if $I^{(s)}=I^s$ for all $s\geq 1$, where $I^{(s)}$ denotes the $s$-th symbolic power of $I$. Let $I$ be a support-2 monomial ideal such that its irreducible…

交换代数 · 数学 2025-11-21 Paromita Bordoloi , Kanoy Kumar Das , Rajiv Kumar

In this paper, we investigate which classes of monomial ideals have a quasi-additive property of homological shift ideals. More precisely, for a monomial ideal $I$ we are interested to find out whether $HS_{i+j}(I)\subseteq HS_i(HS_j(I))$.…

交换代数 · 数学 2023-10-24 Shamila Bayati

For an increasing weighted tree $G_\omega$, we obtain an asymptotic value and a sharp bound on the index stability of the depth function of its edge ideal $I(G_\omega)$. Moreover, if $G_\omega$ is a strictly increasing weighted tree, we…

交换代数 · 数学 2025-09-11 Truong Thi Hien , Jiaxin Li , Tran Nam Trung , Guangjun Zhu