Abstract:
We present a probabilistic algorithm which computes, from a finite set of polynomials defining an algebraic variety V ⊆ double-struck n, the decomposition of V into equidimensional components. The algorithm allows to obtain, for each equidimensional component of V, a set of n + 1 polynomials of bounded degrees defining it. Its sequential complexity is lower than the complexities of the known algorithms solving the same task. © 2000 Académie des sciences/Éditions scientifiques et médicales Elsevier SAS.
Referencias:
- Chistov, A.L., Grigor'ev, D.Y., (1983) Subexponential Time Solving Systems of Algebraic Equations, , LOMI preprint E-9-83, E-10-83, Steklov Institute, Leningrad
- Elkadi, M., Mourrain, B., A new algorithm for the geometric decomposition of a variety (1999) Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation
- Giusti, M., Heintz, J., Algorithmes - Disons rapides - Pour la décomposition d'une variété algébrique en composantes irréductibles et équidimensionnelles (1991) Progress in Mathematics, 94, pp. 169-193. , Birkhäuser
- Giusti, M., Heintz, J., La détermination des points isolés et de la dimension d'une variété algébrique peut se faire en temps polynomial (1993) Symposia Matematica, 34, pp. 216-256
- Heintz, J., Definability and fast quantifier elimination in algebraically closed fields (1983) Theoret. Comput. Sci., 24, pp. 239-277
- Jeronimo, G., Sabia, J., Effective Equidimensional Decomposition of Affine Varieties, , manuscript
- Krick, T., Pardo, L.M., A computational method for diophantine aproximation (1996) Progress in Mathematics, 143, pp. 193-253
- Krick, T., Pardo, L.M., Sombra, M., Sharp Estimates for the Arithmetic Nullstellensatz, , manuscript
- Lecerf, G., Computing an Equidimensional Decomposition of an Algebraic Variety by Means of Geometric Resolutions, , manuscript
- Sabia, J., Solernó, P., Bounds for traces in complete intersections and degrees in the Nullstellensatz (1995) AAECC J., 6, pp. 353-376
- Schwartz, J.T., Fast probabilistic algorithms for verification of polynomial identities (1980) J. ACM., 27, pp. 701-717
Citas:
---------- APA ----------
Jeronimo, G. & Sabia, J.
(2000)
. Probabilistic equidimensional decomposition * . Comptes Rendus de l'Academie des Sciences - Series I: Mathematics, 331(6), 485-490.
http://dx.doi.org/10.1016/S0764-4442(00)01659-1---------- CHICAGO ----------
Jeronimo, G., Sabia, J.
"Probabilistic equidimensional decomposition * "
. Comptes Rendus de l'Academie des Sciences - Series I: Mathematics 331, no. 6
(2000) : 485-490.
http://dx.doi.org/10.1016/S0764-4442(00)01659-1---------- MLA ----------
Jeronimo, G., Sabia, J.
"Probabilistic equidimensional decomposition * "
. Comptes Rendus de l'Academie des Sciences - Series I: Mathematics, vol. 331, no. 6, 2000, pp. 485-490.
http://dx.doi.org/10.1016/S0764-4442(00)01659-1---------- VANCOUVER ----------
Jeronimo, G., Sabia, J. Probabilistic equidimensional decomposition * . C. R. Acad. Sci. Ser. I Math. 2000;331(6):485-490.
http://dx.doi.org/10.1016/S0764-4442(00)01659-1