Navegar

Colección

Datos Estadísticas

Artículo

Armendáriz, I.; Solernó, P.; Mora T.; Cohen G.; Giusti M. "On the computation of the radical of polynomial complete intersection ideals" (1995) 11th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC 1995. 948:106-119
El editor solo permite decargar el artículo en su versión post-print desde el repositorio. Por favor, si usted posee dicha versión, enviela a
Consulte el artículo en la página del editor
Consulte la política de Acceso Abierto del editor

Abstract:

This paper deals with the effective computation of the radical of certain polynomial ideals. Let k be a characteristic zero field, f1,…, fn−r ε k[X1,…, Xn] a regular sequence with d:=maxj deg fj, (Formula presented.) the generated ideal (Formula presented.) its radical, and suppose that the factor ring (Formula presented.) is a Cohen-Macaulay ring. Under these assumptions we exhibit a single exponential algorithm which computes a system of generators of (Formula presented.). © Springer-Verlag Berlin Heidelberg 1995.

Registro:

Documento: Artículo
Título:On the computation of the radical of polynomial complete intersection ideals
Autor:Armendáriz, I.; Solernó, P.; Mora T.; Cohen G.; Giusti M.
Filiación:Departamento de Matemáticas., Universidad de Buenos Aires, Buenos Aires, 1428, Argentina
Departamento de Economía y Matemática, Universidad de San Andrés, Vito Dumas 284, Victoria, Buenos Aires 1644, Argentina
Palabras clave:Artificial intelligence; Computers; Cohen-Macaulay; Complete intersection; Exponential algorithms; Zero fields; Algebra
Año:1995
Volumen:948
Página de inicio:106
Página de fin:119
DOI: http://dx.doi.org/10.1007/3-540-60114-7
Título revista:11th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC 1995
Título revista abreviado:Lect. Notes Comput. Sci.
ISSN:03029743
Registro:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v948_n_p106_Armendariz

Referencias:

  • Alonso, M., Mora, T., Raimondo, M., Local decomposition algorithms.-Proc (1991) 8th. Int. Conf. Applied Algebra, Algebraic Algorithms and Error Correcting Codes AAECC-8, Springer Lect. Notes Comput. Sci, 508, pp. 208-221
  • Bayer, D., Mumford, D., (1993) What Can Be Computed in Algebraic Geometry? Computational Algebraic Geometry and Commutative Algebra, Cortona 1991, pp. 1-48. , D, Eisenbud and L. Robbiano, eds. Symposia Math. XXXIV, Cambridge Univ. Press
  • Berenstein, C., Struppa, D., Recent improvements in the Complexity of the Effective Nullstellensatz (1991) Linear Algebra and its Appl, 157, pp. 203-215
  • Berkowitz, S., On computing the determinant in small parallel time using a small number of processors (1984) Inform Process. Lett, 18, pp. 147-150
  • Caniglia, L., Galligo, A., Heintz, J., Some new effectivity bounds in computational geometry (1989) Proc 6th Int. Conf. Applied Algebra, Algebraic Algorithms and Error Correcting Codes AAECC-6, 357, pp. 131-151. , Roma 1988, Springer Lect. Notes Comput. Sci
  • Demazure, M., (1984) Le monoïde de Mayr et Meyer.-Notes Informelles de Calcul Formel, , Ecole Poly technique, Palaiseau
  • Dickenstein, A., Giusti, M., Fitchas, N., Sessa, C., The membership problem for unmixed polynomial ideals is solvable in single exponential time (1991) Discrete Appl Math, 33, pp. 73-94
  • Dickenstein, A., Sessa, C., Duality methods for the membership problem (1991) Effective Methods in Algebraic Geometry MEGA 90, pp. 89-103. , T, Mora and C. Traverso, eds., Progress in Mathematics Vol. 94, Birkhàuser
  • Eisenbud, D., Huneke, C., Vasconcelos, W., Direct methods for primary decomposition (1992) Inv Math, 110, pp. 207-235
  • Fitchas, N., Giusti, M., Smietanski, F., (1992) Sur la complexité du théorème des zéros, , Preprint Ecole Polytechnique Palaiseau
  • Giusti, M., Heintz, J., Sabia, J., On the efficiency of effective Nullstellensätze (1993) Comput Complexity, 3, pp. 56-95. , Birkhaüser
  • Grothendieck, A., Dieudonné, J., Éléments de géometiie algébrique IV (1967) Publ. Math. Inst. Hautes Étud. Sci, p. 32
  • Gruson, L., Lazarsfeld, R., Peskine, C., On a Theorem of Castelnuovo, and the Equations Defining Space Curves (1983) Inv Math, 72, pp. 493-506
  • Heintz, J., Definability and Fast Quantifier Elimination in Algebraically Closed Fields (1983) Theoret Comput. Sci, 24, pp. 239-277
  • Iversen, B., Genezic Local Structures in Commutative Algebra (1973) Lect. Notes in Math, 310p. , Springer-Verlag
  • Kaplansky, I., (1970) Commutative rings, , Allyn and Bacon
  • Krick, T., Logar, A., An algorithm for the computation of the radical of an ideal in the ring of polynomials (1992) Proc AAECC-9, New Orleans 1991, pp. 195-205. , LN Comp. Sci. 539. Springer-Verlag
  • Kunz, E., Kālher Differentials (1986) Adv. Lect. in Math, , Vieweg Verlag
  • Lam, T.Y., Serre's Conjecture (1978) Springer Lect. Notes in Math, p. 635
  • Matsumura, H., Commutative ring theory (1989) Cambridge Studies in Adv. Math, 8p. , Cambridge University Press
  • Mayr, E., Meyer, A., The complexity of the word problem for commutative semigroups and polynomial ideals (1982) Adv Math, 46, pp. 305-329
  • Mumford, D., (1970) Varieties defined by quadratic equations, pp. 29-100. , Questions on Algebraic Varieties, Centro Internationale de Matematica Estivo, Cremonese, Roma
  • Rossi, F., Spanghet, W., Some effective methods in the openness of loci for Cohen-Macaulay and Gorenstein properties.-Effective Methods in Algebraic Geometry (1990) Proc Intern. Conf. MEGA 90, pp. 441-455. , Castiglioncello 1990, T. Mora and C. Traverso, eds., Progress in Mathematics Vol. 94 Birkhãuser
  • Sabia, J., Solernó, P., (1994) Bounds for traces in Complete Intersections and Degrees in the Nullstellensatz, , To appear in AAECC Journal, Springer-Verlag
  • Serre, J.-P., Algèbre Locale-Multiplicités (1965) Springer Lect. Notes in Math, 11
  • Teissier, B., Resultats récents d'algèbre commutative effective (1991) Séminaire Bourbaki 1989-1990, Astérisque, 189-190, pp. 107-131A4 -

Citas:

---------- APA ----------
Armendáriz, I., Solernó, P., Mora T., Cohen G. & Giusti M. (1995) . On the computation of the radical of polynomial complete intersection ideals. 11th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC 1995, 948, 106-119.
http://dx.doi.org/10.1007/3-540-60114-7
---------- CHICAGO ----------
Armendáriz, I., Solernó, P., Mora T., Cohen G., Giusti M. "On the computation of the radical of polynomial complete intersection ideals" . 11th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC 1995 948 (1995) : 106-119.
http://dx.doi.org/10.1007/3-540-60114-7
---------- MLA ----------
Armendáriz, I., Solernó, P., Mora T., Cohen G., Giusti M. "On the computation of the radical of polynomial complete intersection ideals" . 11th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC 1995, vol. 948, 1995, pp. 106-119.
http://dx.doi.org/10.1007/3-540-60114-7
---------- VANCOUVER ----------
Armendáriz, I., Solernó, P., Mora T., Cohen G., Giusti M. On the computation of the radical of polynomial complete intersection ideals. Lect. Notes Comput. Sci. 1995;948:106-119.
http://dx.doi.org/10.1007/3-540-60114-7