A new algorithm for the geometric decomposition of a variety

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A new algorithm for the geometric decomposition of a variety

Full text

Pdf (857 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 1999 international symposium on Symbolic and algebraic computation table of contents

Vancouver, British Columbia, Canada

Pages: 9 - 16

Year of Publication: 1999

ISBN:1-58113-073-2

Authors

Mohamed Elkadi	UNSA, UMR 6621, Part Valrose, B.P. 71, 06108 Nice Ccdex02, France
Bernard Mourrain	INRIA, SAGA, 2004 route des Lucioles, B.P. 93, 06902 Sophia Antipolis, France

Sponsors

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
SIGNUM: ACM Special Interest Group on Numerical Mathematics

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 14, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/309831.309843 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	M. E. Alonso , E. Becker , M.-F. Roy , T. Wörmann, Zeros, multiplicities, and idempotents for zero-dimensional systems, Algorithms in algebraic geometry and applications, Birkhauser Verlag, Basel, Switzerland, 1996
	2	AIJBRY. P. Ensemble, s triangulaircs de polyn~rnes et r~~sol'ution de syst~rnes algdbriques. Implantation en Axiom. PhD thesis, Univ. Paris VI, 1999.
	3	E. Becker , J. P. Cardinal , M.-F. Roy , Z. Szafraniec, Multivariate Bezoutians, Kronecker symbol and Eisenbud-Levine formula, Algorithms in algebraic geometry and applications, Birkhauser Verlag, Basel, Switzerland, 1996
	4	Thomas Becker , Volker Weispfenning , Heinz Kredel, Gro¨bner bases: a computational approach to commutative algebra, Springer-Verlag, London, 1993
	5	BEI~ENSTEIN, C., GAY, R., VIDRAS. A., AND YGER, A. Residue Currents and Bezout Identities, vol. 114 of Prog. in Math.. Birkh~iuser. 1993.
	6	BERENSTEIN, C.~ AND YGER, A. Residue calculus and Effective Nullstellensatz. Amer. J. Math., 121 (1999).
	7	Bp;ZOUT, E. Th.dor'i~; Gdndr'ale de.~ Equations Algdbriques. Paris, 1779.
	8	Busl~. L., EI.K..XDI, M., AND h:IoUnnAIN, B. Generalized resultant over an algebraic variety. Sul)mitted, 1999.
	9	John Canny, Generalised characteristic polynomials, Journal of Symbolic Computation, v.9 n.3, p.241-250, March 1990 [doi>10.1016/S0747-7171(08)80012-0]
	10	CAnt),YAL, J., AND M()I:RRAIN, B. Algebraic approach of residues and applications. In Proc. AMS-SIA M Surrtmer Seminar on Math. of Numerical Analysis, (Park City, Utah, 1995) (1996), J. Renegar, M. Shub, and S. Smale, E(ts., vol. 32 of Lectures in Applied Math., Am. Math. Soc. Press, pp. 189-210.
	11	CIJARDIN, M. Multivariate sul)resultants. J. Pure and Appl. Alg. 101 (1995), 129-138.
	12	C, HISTOV, A. Algorithm of polynomial complexity for factoring polynomials and finding the components of va.rieties ill subexl)oncntial time. J. Soy. Math 3~, 4 (1986), 1838 1882.
	13	ELKADI. h{., AND h'IOLIRItAIN. B. Approche effective des r6sidus alg6briques. Rapport de Rectmrche 2884, INRIA, 1996.
	14	ELKAD1, h:1.. AND I~'IOURRAIN, B. Sonl(.' applications of Bezoutians in effe(:tive algebraic geometry. Rapport de Recherche 3572, INRIA, 1998.
	15	ELKADI, M.. AND MOURRAIN, B. Algorithms for residues and Lojasicwicz exponents. J. of Pure and Applied Algebra (1999). To appear.
	16	FITC.IIAS, N., GIUSTI, h'I., AND SMIETANSKI, h,~. Sur la complexit du thorme des zros. In Proc. of the second. Int. Conf. on Approximation and Optimization (La Hitbana, 1993), J. Gudatt, Ed., Peter Lang Verlag, pp. 274--329.
	17	GALLO. G., AND h'IlSHl~A, B. Efficient Algorithms and Bounds for Wu-Ritt Characteristic Sets. In Effective Mcthod.s in Algebraic Geometry (MEGA '90) (1991), vol. 94 of Progress in Math., Birkhuser. pp. 119-142.
	18	GELFAND, I.: KAPR.ANOV, h.{., AND ZELEVINSKY, A. Discriminants, Resultants and Multidimensional Determinants. Birkhiiuser, Boston-Basel-Berlin, 1994.
	19	Patrizia Gianni , Barry Trager , Gail Zacharias, Gro¨bner bases and primary decomposition of polynomial ideals, Journal of Symbolic Computation, v.6 n.2-3, p.149-167, Oct./Dec. 1988 [doi>10.1016/S0747-7171(88)80040-3]
	20	GIUSTI, M.. ANi) HV:IN'I'Z, J. Algorithmes- disons rapides- pour la ddcomposition d'une vari~t(~ alg5brique en composantes irrOductibles et ~quidiinensionimlles. In Effective Methods in Algebraic Geometry (MEGA'90) (1991), vol. 9-1 of Progress in Math., Birkhuser, pp. 169- 193.
	21	GIUSTI, M., AND HEIN'rZ, J. La ddtermination des points isolds et de la dimension d'une w~ri~t~5 algP.brique peut se faire en tenlps polynomial, hi Proc Int. Meeting on Commutative Algebra (Cortona,1991), vol. XXXIV of Syrup. Mathematica, pp. 216-255.
	22	GRIc, oPo,'Ev, D. Factorization of polynomials over finite field and the solution of systems of algebraic equations. ,1. Soy. Math 34, 4 (1986), 1762 1803.
	23	HABSIEGER., L. Stir un problbme combinatoire. Cominunication personncllc, 1998.
	24	Michael Kalkbrener, A generalized Euclidean algorithm for computing triangular representations of algebraic varieties, Journal of Symbolic Computation, v.15 n.2, p.143-167, Feb. 1993 [doi>10.1006/jsco.1993.1011]
	25	T. Krick , L. M. Pardo, A computational method for diophantine approximation, Algorithms in algebraic geometry and applications, Birkhauser Verlag, Basel, Switzerland, 1996
	26	KUNZ, E. Kiihler differentials. Advanced lectures in Mathematics. Friedr. Vieweg a.nd Sohn, 1986.
	27	D. Lazard, A new method for solving algebraic systems of positive dimension, Discrete Applied Mathematics, v.33 n.1-3, p.147-160, Nov. 1991 [doi>10.1016/0166-218X(91)90113-B]
	28	h'IACAULAY, F. On the Resolution of a given Modular Syst, em into Primary Systems Including some Properties of Hilbert Numbers. Proc. London Math. Soc. (1912), 66--121.
	29	MATSUMURA, H. Commutative Algebra. Mathematics Le(:ture Notes Series. The Benjainin/Cummings Publishing Company, 1980.
	30	B. Mourrain, Computing the isolated roots by matrix methods, Journal of Symbolic Computation, v.26 n.6, p.715-738, Dec. 1998 [doi>10.1006/jsco.1998.0236]
	31	James Renegar, On the computational complexity and geometry of the first-order theory of the reals. Par I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals, Journal of Symbolic Computation, v.13 n.3, p.255-299, March 1992
	32	P~OUILLIEtt, F. Algorithmes e fficaces pour l'dtude des zdros rdels des syst~mes polynomiaux. PhD thesis, UniversitY, de Relines, 1996.
	33	SABIA, J., ANI) SOI.~:RNO, P. Bounds for traces in complete intersections and degrees in the Nullstellenstaz. AAECC-6 948 (1995), 353--376.
	34	SCHE.IA, G., AND STORCH, U. i)ber Spurfunktionen bei vollst~ndigen Durschnitten. ,l. Reine Angew Mathematik 278 (1975), 174-190.
	35	Wolmer V. Vasconcelos , Daniel R. Grayson , Michael Stillman , David Eisenbud , Jüurgen Herzog, Computational methods in commutative algebra and algebraic geometry, Springer-Verlag New York, Inc., Secaucus, NJ, 1997
	36	Wen-Tsun Wu, Basic principles of mechanical theorem proving in elementary geometrics, Journal of Automated Reasoning, v.2 n.3, p.221-252, Aug. 1987 [doi>10.1007/BF02328447]

CITED BY 2

	Grégoire Lecerf, Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions, Proceedings of the 2000 international symposium on Symbolic and algebraic computation, p.209-216, July 2000, St. Andrews, Scotland
	Grégoire Lecerf, Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers, Journal of Complexity, v.19 n.4, p.564-596, August 2003