When does (T) equal sat(T)?

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

When does (T) equal sat(T)?

Full text

Pdf (231 KB)

Source

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

Linz/Hagenberg, Austria

SESSION: Contributed papers table of contents

Pages 207-214

Year of Publication: 2008

ISBN:978-1-59593-904-3

Authors

Francois Lemaire	University of Lille 1, Lille, France
Marc Moreno Maza	University of Western Ontario, London, ON, Canada
Wei Pan	University of Western Ontario, London, ON, Canada
Yuzhen Xie	University of Western Ontario, London, ON, Canada

Sponsors

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 25, Citation Count: 1

Additional Information:

abstract 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/1390768.1390798 What is a DOI?

ABSTRACT

Given a regular chain T, we aim at finding an efficient way for computing a system of generators of Sat(T), the saturated ideal of T. A natural idea is to test whether the equality {T}=Sat(T) holds, that is, whether T generates its saturated ideal. By generalizing the notion of primitivity from univariate polynomials to regular chains, we establish a necessary and sufficient condition, together with a Grobner basis free algorithm, for testing this equality. Our experimental results illustrate the efficiency of this approach in practice.

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	J. Arnold and R. Gilmer. On the contents of polynomials. Proc. Amer. Math. Soc., 24:556--562, 1970.
	2	Philippe Aubry , Daniel Lazard , Marc Moreno Maza, On the theories of triangular sets, Journal of Symbolic Computation, v.28 n.1-2, p.105-124, July/Aug. 1999 [doi>10.1006/jsco.1999.0269]
	3	Philippe Aubry , Marc Moreno Maza, Triangular sets for solving polynomial systems: a comparative implementation of four methods, Journal of Symbolic Computation, v.28 n.1-2, p.125-154, July/Aug. 1999 [doi>10.1006/jsco.1999.0270]
	4	F. Boulier, F. Lemaire, and M. Moreno Maza. Well known theorems on triangular systems and the d5 principle. In Transgressive Computing 2006, 2006.
	5	C. Chen, F. Lemaire, O. Golubitsky, M. Moreno Maza, and W. Pan. Comprehensive triangular decomposition. In Lecture Notes in Computer Science, volume 4770, pages 73--101. Springer-Verlag, 2007.
	6	C. Chen, F. Lemaire, M. Moreno Maza, W. Pan, and Y. Xie. Efficient computations of irredundant triangular decompositions with the REGULARCHAINS library. Proc. of CASA2007, 2007.
	7	S.C. Chou and X.S. Gao. On the dimension of an arbitrary ascending chain. Chinese Bull. of Sci., 38:799--804, 1991.
	8	T. Coquand, L. Ducos, H. Lombardi, and C. Quitté. L'idéal des coefficients du produit de deux polynômes. Revue des Mathématiques de l'enseignement Supérieur, 113(3):25--39, 2003.
	9	A. Corso, W. V. Vasconcelos, and R. H. Villarreal. On the contents of polynomials. J. Pure. Appl. Algebra, 125(1-3):117--127, 1998.
	10	D. Eisenbud. Commutative Algebra. Springer-Verlag, 1994.
	11	E. Hubert. Notes on triangular sets and triangulation-decomposition algorithms i: Polynomial systems. In SNSC, pages 1--39, 2001.
	12	F. Ischebeck and R. A. Rao. Ideals and reality. Projective modules and number of generators of ideals. Springer-Verlag, 2005.
	13	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]
	14	Michael Kalkbrener, Algorithmic properties of polynomial rings, Journal of Symbolic Computation, v.26 n.5, p.525-581, Nov. 1, 1998 [doi>10.1006/jsco.1998.0227]
	15	F. Lemaire, M. Moreno Maza, and Y. Xie. The RegularChains library. In Ilias S. Kotsireas, editor, Maple Conference 2005, pages 355--368, 2005.
	16	Michael Monagan , Roman Pearce, Rational simplification modulo a polynomial ideal, Proceedings of the 2006 international symposium on Symbolic and algebraic computation, July 09-12, 2006, Genoa, Italy [doi>10.1145/1145768.1145809]
	17	M. Moreno Maza. On triangular decompositions of algebraic varieties. Technical Report TR 4/99, NAG Ltd, Oxford, UK, 1999. Presented at the MEGA-2000 Conference, Bath, England. http://www.csd.uwo.ca/moreno.
	18	Marc Moreno Maza , Renaud Rioboo, Polynomial Gcd Computations over Towers of Algebraic Extensions, Proceedings of the 11th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, p.365-382, July 17-22, 1995
	19	B. Sturmfels. Solving Systems of Polynomial Equations. Amer. Math. Soc., 2002.
	20	Dongming Wang, Computing triangular systems and regular systems, Journal of Symbolic Computation, v.30 n.2, p.221-236, Aug. 2000 [doi>10.1006/jsco.1999.0355]
	21	W.T. Wu. On zeros of algebraic equations -- an application of Ritt principle. Kexue Tongbao, 31(1):1-5, 1986.
	22	L. Yang and J. Zhang. Searching dependency between algebraic equations: an algorithm applied to automated reasoning. Technical report ic/91/6, International Atomic Engery Angency, Miramare, Trieste, Italy, 1991.