2004
DOI: 10.1016/j.aim.2003.10.001
|View full text |Cite
|
Sign up to set email alerts
|

Castelnuovo–Mumford regularity by approximation

Abstract: The Castelnuovo-Mumford regularity of a module gives a rough measure of its complexity. We bound the regularity of a module given a system of approximating modules whose regularities are known. Such approximations can arise naturally for modules constructed by inductive combinatorial means. We apply these methods to bound the regularity of ideals constructed as combinations of linear ideals and the module of derivations of a hyperplane arrangement as well as to give degree bounds for invariants of finite group… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
21
0

Year Published

2006
2006
2021
2021

Publication Types

Select...
5
2

Relationship

2
5

Authors

Journals

citations
Cited by 22 publications
(21 citation statements)
references
References 17 publications
0
21
0
Order By: Relevance
“…A differential operator homogeneous of order 1 is nothing but a derivation. Hence D (1) (A) is the module of logarithmic derivations along A.…”
Section: The Modules Of Differential Operators For a Hyperplane Arran...mentioning
confidence: 99%
See 2 more Smart Citations
“…A differential operator homogeneous of order 1 is nothing but a derivation. Hence D (1) (A) is the module of logarithmic derivations along A.…”
Section: The Modules Of Differential Operators For a Hyperplane Arran...mentioning
confidence: 99%
“…To prove that D (1) (A) is a free S-module, the Saito criterion ([8, Theorem 1.8 (ii)], see also [6,Theorem 4.19]) is very useful. Holm [4] generalized the Saito criterion to the one for D (m) (A).…”
Section: Saito-holm Criterionmentioning
confidence: 99%
See 1 more Smart Citation
“…For one proof of this, see Jiang and Feng [11], §4.2. Finally, we note that Derksen and Sidman [4] have recently obtained regularity bounds on D(A) for higher dimensional arrangements.…”
Section: Corollary 35 For An Arrangement On D Lines Reg(d) ≤ D − 2mentioning
confidence: 99%
“…Sidman and the author proved reg(I ) ≤ m in [3,4]. Easy considerations show that these regularity bounds imply the existence of polynomials h I (d) and h J (d) such that …”
Section: Subspace Arrangementsmentioning
confidence: 99%