On reducing a system of equations to a single equation

For a system of polynomial equations over Q;p; we present an efficient construction of a single polynomial of quite small degree whose zero set over Q;p; coincides with the zero set over Q;p; of the original system. We also show that the polynomial has some other attractive features such as low additive and straight-line complexity.The proof is based on a link established here between the above problem and some recent number theoretic result about zeros of p-adic forms.

[1]  Marek Karpinski,et al.  On Zero-Testing and Interpolation of k-Sparse Multivariate Polynomials Over Finite Fields , 1991, Theor. Comput. Sci..

[2]  Marek Karpinski,et al.  A Zero-Test and an Interpolation Algorithm for the Shifted Sparse Polynominals , 1993, AAECC.

[3]  L. J. Mordell.  Systems of Congruences , 1973, Canadian Mathematical Bulletin.

[4]  J. Maurice Rojas,et al.  Additive Complexity and Roots of Polynomials over Number Fields and \mathfrak{p} -adic Fields , 2002, ANTS.

[5]  Ulrich Meyer,et al.  Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths , 2004, SWAT.

[6]  Hugh L. Montgomery,et al.  On zeros of $p$-adic forms. , 1983 .

[7]  Marek Karpinski,et al.  Algorithms for sparse rational interpolation , 1991, ISSAC '91.

[8]  Kai Werther,et al.  The complexity of sparse polynomial interpolation over finite fields , 1994, Applicable Algebra in Engineering, Communication and Computing.

[9]  Peter D. Mosses,et al.  Pragmatics of Modular SOS , 2002, AMAST.

[10]  Marek Karpinski,et al.  Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields , 1988, SIAM J. Comput..

[11]  Michael Clausen,et al.  Algebraic complexity theory , 1997, Grundlehren der mathematischen Wissenschaften.

[12]  Michael Ben-Or,et al.  A deterministic algorithm for sparse multivariate polynomial interpolation , 1988, STOC '88.

[13]  Jeffrey Shallit,et al.  The Computational Complexity of Some Problems of Linear Algebra , 1996 .

[14]  Olivier Danvy,et al.  A functional correspondence between call-by-need evaluators and lazy abstract machines , 2003, Inf. Process. Lett..

[15]  Marek Karpinski,et al.  Computational Complexity of Sparse Rational Interpolation , 1994, SIAM J. Comput..

[16]  Jean-Jacques Risler,et al.  Additive Complexity and Zeros of Real Polynomials , 1985, SIAM J. Comput..

[17]  Marek Karpinski,et al.  On Some Approximation Problems Concerning Sparse Polynomials over Finite Fields , 1996, Theor. Comput. Sci..

[18]  J. Maurice Rojas.  Additive Complexity and p-adic Roots of Polynomials , 2002 .

[19]  Ron M. Roth,et al.  Interpolation and Approximation of Sparse Multivariate Polynomials over GF(2) , 1991, SIAM J. Comput..

[20]  Jean-Jacques Risler,et al.  Havansky Theorem and complexity theory , 1984 .

[21]  Richard Zippel,et al.  Effective polynomial computation , 1993, The Kluwer international series in engineering and computer science.

[22]  Igor E. Shparlinski,et al.  On Reducing a System of Equations to a Single Equation , 2004 .

[23]  Igor E. Shparlinski,et al.  Sparse polynomial approximation in finite fields , 2001, STOC '01.

[24]  D. Grigor'ev,et al.  Lower bounds in algebraic computational complexity , 1985 .

[25]  W. Dale Brownawell.  On p-adic zeros of forms , 1984 .

[26]  G I Arhipov,et al.  ON LOCAL REPRESENTATION OF ZERO BY A FORM , 1982 .

[27]  J. Maurice Rojas.  Arithmetic multivariate Descartes' rule , 2001 .

[28]  Peter D. Mosses,et al.  Composing programming languages by combining action-semantics modules , 2001, Sci. Comput. Program..

[29]  Wolfgang M. Schmidt.  The solubility of certain p-adic equations , 1984 .

[30]  Bas Luttik,et al.  Split-2 bisimilarity has a finite axiomatization over CCS with Hennessy's merge , 2004, Log. Methods Comput. Sci..

[31]  Nisheeth K. Vishnoi,et al.  Deterministic identity testing for multivariate polynomials , 2003, SODA '03.

[32]  Marek Karpinski,et al.  Zero testing of p-adic and modular polynomials , 2000, Theor. Comput. Sci..

[33]  L. Lipshitz,et al.  p-adic zeros of polynomials. , 1988 .

[34]  Yismaw Alemu,et al.  On zeros of forms over local fields , 1985 .

[35]  Olivier Danvy,et al.  From Interpreter to Logic Engine by Defunctionalization , 2003, LOPSTR.

[36]  Kim G. Larsen,et al.  Optimal Strategies in Priced Timed Game Automata , 2004, FSTTCS.

[37]  Kai Werther.  Sample Complexity of Sparse Polynomials Over Finite Fields , 1994 .