REGULARITY BOUNDS FOR BINOMIAL EDGE IDEALS

被引：61

作者：

Matsuda, Kazunori ^{[1
]}

Murai, Satoshi ^{[2
]}

机构：

[1] Rikkyo Univ, Coll Sci, Dept Math, Toshima Ku, Tokyo 1718501, Japan

[2] Yamaguchi Univ, Dept Math Sci, Fac Sci, Yamaguchi 7538512, Japan

来源：

JOURNAL OF COMMUTATIVE ALGEBRA | 2013年 / 5卷 / 01期

关键词：

D O I：

10.1216/JCA-2013-5-1-141

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We show that the Castelnuovo-Mumford regularity of the binomial edge ideal of a graph is bounded below by the length of its longest induced path and bounded above by the number of its vertices.

引用

页码：141 / 149

页数：9

共 9 条

[1] Bruns W., 1998, COHEN MACAULAY RINGS
[2] Diestel R., 2010, GRAPH THEORY, V173
[3] Grayson Daniel R., Macaulay 2, a software system for research in algebraic geometry
[4] Binomial edge ideals and conditional independence statements
Herzog, Juergen
Hibi, Takayuki
Hreinsdottir, Freyja
Kahle, Thomas
Rauh, Johannes
[J]. ADVANCES IN APPLIED MATHEMATICS, 2010, 45 (03) : 317 - 333
[5] A NEW EXPLICIT FINITE FREE RESOLUTION OF IDEALS GENERATED BY MONOMIALS IN AN R-SEQUENCE
LYUBEZNIK, G
[J]. JOURNAL OF PURE AND APPLIED ALGEBRA, 1988, 51 (1-2) : 193 - 195
[6] Madani SS, 2012, ELECTRON J COMB, V19
[7] Matsui T., PYTHON PROGRAM GENER
[8] GRAPHS AND IDEALS GENERATED BY SOME 2-MINORS
Ohtani, Masahiro
[J]. COMMUNICATIONS IN ALGEBRA, 2011, 39 (03) : 905 - 917
[9] Peeva I, 2011, ALGEBRA APPL, V14, P1, DOI 10.1007/978-0-85729-177-6_1

← 1 →