1987
DOI: 10.1007/bf01389151
|View full text |Cite
|
Sign up to set email alerts
|

A criterion for detectingm-regularity

Abstract: Let S=k[x~ ..... x,] be a polynomial ring over an infinite field k, and let 1 be a homogeneous ideal of S.An algorithm for computing the (first) syzygies of I is due independently to Spear [Spe77] and Schreyer [Sch80]: One chooses an ordering on the monomials of S, and then constructs a monomial ideal in(1) generated by the lead terms of all elements of I, in(l) can be viewed as the limit of 1 under the action of a 1-parameter subgroup of GL(n) on the Hilbert scheme [Bay 82], so in(1) occurs as the special fi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

4
311
0
4

Year Published

1988
1988
2014
2014

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 281 publications
(322 citation statements)
references
References 11 publications
4
311
0
4
Order By: Relevance
“…. , x n ], n ≥ 2 the polynomial ring over K. Bayer and Stillman [2] note that Borel fixed ideals I ⊂ S satisfy the following property: ( * ) (I : x ∞ j ) = (I : (x 1 , . .…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…. , x n ], n ≥ 2 the polynomial ring over K. Bayer and Stillman [2] note that Borel fixed ideals I ⊂ S satisfy the following property: ( * ) (I : x ∞ j ) = (I : (x 1 , . .…”
Section: Introductionmentioning
confidence: 99%
“…Combining these facts, we are done. (1) I is of Borel type, (2) For any monomial u ∈ I and for any integer 1 ≤ j < m(u), there exists an integer…”
Section: Introductionmentioning
confidence: 99%
“…Gröbner bases are also highly sensitive to the monomial order arranging the different monomials of a multivariate polynomial (see, e.g., [6, Chapter 2] for formal definitions). The Degree Reverse Lexicographic (degrevlex) order gives (on average) Gröbner bases with the smallest total degree [2], although there exist known examples (cf. Mora's example in [14]) for which, even for the degrevlex monomial ordering, the (reduced) Gröbner basis contains a polynomial of total degree O(d 2 ).…”
Section: Complexitymentioning
confidence: 99%
“…By the Bayer-Stillman theorem, cf. [5] or [10] we have reg Gin(I j ) = j, too. Now we apply a result of Eisenbud, Reeves and Totaro [11,Proposition 10].…”
Section: Vol 79 (2004)mentioning
confidence: 99%