Effective equidimensional decomposition of affine varieties
In this paper we present a probabilistic algorithm which computes, from a finite set of polynomials defining an algebraic variety V, the decomposition of V into equidimensional components. If V is defined by s polynomials in n variables of degrees bounded by an integer d ≥ n and V = ∪l=0 r Vℓ is the...
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Artículo publishedVersion |
| Lenguaje: | Inglés |
| Publicado: |
2002
|
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_00224049_v169_n2-3_p229_Jeronimo |
| Aporte de: |
| Sumario: | In this paper we present a probabilistic algorithm which computes, from a finite set of polynomials defining an algebraic variety V, the decomposition of V into equidimensional components. If V is defined by s polynomials in n variables of degrees bounded by an integer d ≥ n and V = ∪l=0 r Vℓ is the equidimensional decomposition of V, the algorithm obtains in sequential time bounded by sO(1)dO(n), for each 0 ≤ ℓ ≤r, a set of n + 1 polynomials of degrees bounded by deg(Vℓ) which define Vℓ. © 2002 Elsevier Science B.V. All rights reserved. |
|---|