Comparison of symbolic and ordinary powers of parity binomial edge ideals

被引：0
|
作者：
Taghipour, Nadia [1 ]
Bayati, Shamila [1 ]
Rahmati, Farhad [1 ]
机构：
[1] Amirkabir Univ Technol, Tehran Polytech, Dept Math & Comp Sci, Tehran, Iran
来源：
MONATSHEFTE FUR MATHEMATIK | 2024年 / 203卷 / 03期
关键词：
Clique number; Net-free graph; Parity binomial edge ideal; Symbolic power; MONOMIAL IDEALS; ALGEBRAS; EQUALITY; REPRESENTATIONS; STABILITY; GRAPHS;
D O I：
10.1007/s00605-023-01912-4
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
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 I-G is the parity binomial edge ideal of a graph G, then in each of the following cases the symbolic power I-G((t)) and the ordinary power I-G(t) are not equal for some t: (i) the clique number of G is greater than 3; (ii) G has a net; or (iii) G has a PT as an induced subgraph.
引用
收藏
页码：695 / 710
页数：16
相关论文
共 50 条
12345