Weakly Closed Graphs and F-Purity of Binomial Edge Ideals

被引:7
作者
Matsuda, Kazunori [1 ]
机构
[1] Kitami Inst Technol, Kitami, Hokkaido 0908507, Japan
关键词
binomial edge ideal; closed graph; weakly closed graph; F-pure; EXTREMAL BETTI NUMBERS; COHEN-MACAULAY; REGULARITY;
D O I
10.1142/S1005386718000391
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Herzog, Hibi, Hreindattir et al. introduced the class of closed graphs, and they proved that the binomial edge ideal J(G) of a graph G has quadratic Grobner bases if G is closed. In this paper, we introduce the class of weakly closed graphs as a generalization of the closed graph, and we prove that the quotient ring S/J(G) of the polynomial ring S = K[x(1), . . ., x(n), y(1), . . . ,y(n),] with K a field and n = vertical bar V (G)vertical bar is F-pure if G is weakly closed. This fact is a generalization of Ohtani's theorem.
引用
收藏
页码:567 / 578
页数:12
相关论文
共 45 条
[1]  
[Anonymous], ARXIV14123542
[2]  
[Anonymous], 2008, THESIS
[3]  
[Anonymous], 2014, BRIDGING ALGEBRA GEO
[4]  
[Anonymous], ARXIV161110117
[5]  
[Anonymous], MACAULAY2 SOFTWARE S
[6]  
[Anonymous], ELECT J COMBIN
[7]  
[Anonymous], INVOLVE
[8]  
[Anonymous], 1969, Graph Theory
[9]  
Badiane M, 2017, ELECTRON J COMB, V24
[10]   Binomial edge ideals of bipartite graphs [J].
Bolognini, Davide ;
Macchia, Antonio ;
Strazzanti, Francesco .
EUROPEAN JOURNAL OF COMBINATORICS, 2018, 70 :1-25