On systems of algebraic equations with parametric exponents

ABSTRACT

We deal with systems of algebraic equations with parametric exponents. As the first step for solving such systems,we consider the most simple cases, univariate case and 0-dimensional case, and give a concrete method for computing Gröbner bases. From studies on such cases, we derive a simple formulation and basic notions which will be helpful to deal with more complicated cases.

REFERENCES

• 1: V.I. Arnold. Critical points of smooth functions and their normal forms. Russian Math. Surveys 30:5:1--75, 1975.
• 2: B. Buchberger. An algorithm for finding a basis for the residue class ring of a zero-dimensional polynomial ideal (German). PhD Thesis, University of Innsbruck, Institute for Mathematics, 1965.
• 3: T. Becker, V. Weispfenning. Gröbner Bases. GTM 141, Springer-Verlag, New York, 1993.
• 4: D. Cox, J. Little, D. O'Shea. Ideals, Varieties, and Algorithms. UTM, Springer-Verlag, 1992.
• 5: Antonio Montes, A new algorithm for discussing Gröbner bases with parameters, Journal of Symbolic Computation, v.33 n.2, p.183-208, February 2002 [doi>10.1006/jsco.2001.0504]
• 6: A. Neumaier. Introduction to Numerical Analysis. Cambridge University Press, 2001.
• 7: Siegfried M. Rump, Solving algebraic problems with high accuracy, Proc. of the symposium on A new approach to scientific computation, p.51-120, December 1983, IBM Thomas J. Watson Research Center, Yorktown Heights, New York, United States
• 8: Takeshi Shimoyama , Kazuhiro Yokoyama, Localization and primary decomposition of polynomial ideals, Journal of Symbolic Computation, v.22 n.3, p.247-277, Sept. 1996 [doi>10.1006/jsco.1996.0052]
• 9: T. Takahashi. An application of Gröbner bases for a hierarchical defining equation of singularity. preprint, 2003.
• 10: Volker Weispfenning, Comprehensive Gro¨bner bases, Journal of Symbolic Computation, v.14 n.1, p.1-29, July 1992 [doi>10.1016/0747-7171(92)90023-W]
• 11: Volker Weispfenning, Canonical comprehensive Gröbner bases, Proceedings of the 2002 international symposium on Symbolic and algebraic computation, p.270-276, July 07-10, 2002, Lille, France [doi>10.1145/780506.780541]
• 12: V. Weispfenning. Gröbner bases for binomials with parametric exponents, preprint, 2004.

INDEX TERMS

Primary Classification:
  I. Computing Methodologies
  I.1 SYMBOLIC AND ALGEBRAIC MANIPULATION
      I.1.2 Algorithms

General Terms:
Algorithms, Theory

Keywords:
Gröbner basis, ideals with parametric exponents