Skip to main content
Springer Nature Link
Log in

Additive Complexity and Roots of Polynomials over Number Fields and \( \mathfrak{p} \) -adic Fields

  • Conference paper
  • First Online:
Algorithmic Number Theory (ANTS 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2369))

Included in the following conference series:

  • 1647 Accesses

Abstract

Consider any nonzero univariate polynomial with rational coefficients, presented as an elementary algebraic expression (using only integer exponents). Letting σ(f) denotes the additive complexity of f, we show that the number of rational roots of f is no more than 15 + σ(f)2(24.01)σ(f)σ(f) !. This provides a sharper arithmetic analogue of earlier results of Dima Grigoriev and Jean-Jacques Risler, which gave a bound of Cσ(f)2 for the number of real roots of f, for σ(f) sufficiently large and some constant C with 1 < C < 32. We extend our new bound to arbitrary finite extensions of the ordinary or p-adic rationals, roots of bounded degree over a number field, and geometrically isolated roots of multivariate polynomial systems. We thus extend earlier bounds of Hendrik W. Lenstra, Jr. and the author to encodings more efficient than monomial expansions. We also mention a connection to complexity theory and note that our bounds hold for a broader class of fields.

This research was partially supported by a grant from the Texas A&M College of Science.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Blum, Lenore; Cucker, Felipe; Shub, Mike; and Smale, Steve, Complexity and Real Computation, Springer-Verlag, 1998.

    Google Scholar 

  2. Borodin, Allan and Cook, Stephen A., “On the Number of Additions to Compute Specific Polynomials,” SIAM J. Comput. 5 (1976), no. 1, pp. 146–157.

    Article  MATH  MathSciNet  Google Scholar 

  3. Fulton, William, Intersection Theory, 2nd ed., Ergebnisse der Mathematik und ihrer Grenzgebiete 3, 2, Springer-Verlag, 1998.

    Google Scholar 

  4. Grigor’ev, Dima Yu., “Lower Bounds in the Algebraic Complexity of Computations, ” The Theory of the Complexity of Computations, I; Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov (LOMI) 118 (1982), pp. 25–82,214.

    MathSciNet  MATH  Google Scholar 

  5. Khovanski, Askold G., “On a Class of Systems of Transcendental Equations, ” Dokl. Akad. Nauk SSSR 255 (1980), no. 4, pp. 804–807; English transl. in Soviet Math. Dokl. 22 (1980), no. 3.

    MathSciNet  Google Scholar 

  6. -, Fewnomials, AMS Press, Providence, Rhode Island, 1991.

    Google Scholar 

  7. Koblitz, Neal I., p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd ed., Graduate Texts in Mathematics, 58, Springer-Verlag, New York-Berlin, 1984.

    Google Scholar 

  8. Lenstra, Hendrik W., Jr., “On the Factorization of Lacunary Polynomials,” Number Theory in Progress, Vol. 1 (Zakopane-Kóscielisko, 1997), pp. 277–291, de Gruyter, Berlin, 1999.

    Google Scholar 

  9. Risler, Jean-Jacques, “Additive Complexity and Zeros of Real Polynomials, ” SIAM J. Comput. 14 (1985), no. 1, pp. 178–183.

    Article  MATH  MathSciNet  Google Scholar 

  10. Rojas, J. Maurice, “Toric Intersection Theory for Affine Root Counting,” Journal of Pure and Applied Algebra, vol. 136, no. 1, March, 1999, pp. 67–100.

    Article  MathSciNet  Google Scholar 

  11. -“Algebraic Geometry Over Four Rings and the Frontier to Tractability, ” Contemporary Mathematics, vol. 270, Proceedings of a Conference on Hilbert’s Tenth Problem and Related Subjects (University of Gent, November 1–5, 1999), edited by Jan Denef, Leonard Lipschitz, Thanases Pheidas, and Jan Van Geel, pp. 275–321, AMS Press (2000).

    Google Scholar 

  12. -, “Arithmetic Multivariate Descartes’ Rule,” Math ArXiV preprint math.NT/0110327, submitted for publication.

    Google Scholar 

  13. Shub, Mike, “Some Remarks on Bézout’s Theorem and Complexity Theory,” From Topology to Computation: Proceedings of the Smalefest (Berkeley, 1990), pp. 443–455, Springer-Verlag, 1993.

    Google Scholar 

  14. Smirnov, Andrei L., “Torus Schemes Over a Discrete Valuation Ring,” St. Petersburg Math. J. 8 (1997), no. 4, pp. 651–659.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Texas A&M University, TAMU 3368 College Station, Texas, 77843-3368, USA

    J. Maurice Rojas

Authors
  1. J. Maurice Rojas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Mathematics and Statistics, F07, University of Sydney, Sydney, NSW, 2006, Australia

    Claus Fieker  & David R. Kohel  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rojas, J.M. (2002). Additive Complexity and Roots of Polynomials over Number Fields and \( \mathfrak{p} \) -adic Fields. In: Fieker, C., Kohel, D.R. (eds) Algorithmic Number Theory. ANTS 2002. Lecture Notes in Computer Science, vol 2369. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45455-1_39

Download citation

  • DOI: https://doi.org/10.1007/3-540-45455-1_39

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43863-2

  • Online ISBN: 978-3-540-45455-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics