2004
DOI: 10.1090/s0002-9947-04-03627-x
|View full text |Cite
|
Sign up to set email alerts
|

On the complexity of the integral closure

Abstract: Abstract. The computation of the integral closure of an affine ring has been the focus of several modern algorithms. We will treat here one related problem: the number of generators the integral closure of an affine ring may require. This number, and the degrees of the generators in the graded case, are major measures of cost of the computation. We prove several polynomial type bounds for various kinds of algebras, and establish in characteristic zero an exponential type bound for homogeneous algebras with a s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
3
0

Year Published

2007
2007
2019
2019

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 27 publications
0
3
0
Order By: Relevance
“…Let us phrase one of these situations in the context of Corollary 1.3.35. A different and more comprehensive approach that emphasizes exclusively the multiplicity can be found in [185,Section 3].…”
Section: Therefore N ≤ Jdeg(a/a) ✷mentioning
confidence: 99%
See 1 more Smart Citation
“…Let us phrase one of these situations in the context of Corollary 1.3.35. A different and more comprehensive approach that emphasizes exclusively the multiplicity can be found in [185,Section 3].…”
Section: Therefore N ≤ Jdeg(a/a) ✷mentioning
confidence: 99%
“…For contrast, wed briefly describe some of the related results of [185,Section 3]. Note that their emphasis in exclusively on the multiplicity.…”
Section: Therefore N ≤ Jdeg(a/a) ✷mentioning
confidence: 99%
“…Given the usefulness of Theorem 2.5, it would be worthwhile to look at the situation short of Cohen-Macaulayness. For the integral closure of a standard graded algebra A of dimension d, it was possible in [14] to derive degree bounds assuming only S d−1 for A. Another issue is to compute the relation type of A in Theorem 2.5.…”
mentioning
confidence: 99%