论文标题
奇偶校验二项式边缘理想的规律性
Regularity of parity binomial edge ideals
论文作者
论文摘要
令$ g $作为$ n $顶点的简单图表和$ \ nathcal {i} _g $表示均等的二元二元优势$ g $在多项式环中的$ g $的理想，$ s = \ mathbb {k} [x_1，\ ldots，\ ldots，x_n，x_n，y_1，y_1，y_1，y__ bin parity bin。图。然后，我们对所有均等二项式边缘理想具有规律性$ 3 $的图表进行分类。我们对奇偶元优势理想具有纯粹分辨率的图表进行分类。
Let $G$ be a simple graph on $n$ vertices and $\mathcal{I}_G$ denotes parity binomial edge ideal of $G$ in the polynomial ring $S = \mathbb{K}[x_1,\ldots, x_n, y_1, \ldots, y_n].$ We obtain a lower bound for the regularity of parity binomial edge ideals of graphs. We then classify all graphs whose parity binomial edge ideals have regularity $3$. We classify graphs whose parity binomial edge ideals have pure resolution.
