Skip to main content

Some Remarks on the L-Conjecture

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 2002)

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

Included in the following conference series:

  • 985 Accesses

Abstract

In this paper, we show several connections between the L-conjecture, proposed by Burgisser [3], and the boundedness theorem for the torsion of elliptic curves. Assuming the L-conjecture, a sharper bound is obtained for the number of torsions over extensions of k on an elliptic curve over a number field k, which improves Masser’s result [6]. It is also shown that the Torsion Theorem for elliptic curves [10] follows directly from the WL-conjecture, which is a much weaker version of the L-conjecture. Since the WL-conjecture differs from the trivial lower bound only at the coefficient, this result provides an interesting example where increasing the coefficient in a trivial lower bound of straight-line complexity is difficult and important.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. Lenore Blum, Felipe Cucker, Michael Shub, and Steve Smale. Complexity and Real Computation. Springer-Verlag, 1997.

    Google Scholar 

  2. Dan Boneh. Studies in computational number theory with applications to cryptography. Technical report, Princeton University, 1996.

    Google Scholar 

  3. Peter Burgisser. On implications between P-NP-Hypotheses: Decision versus computation in algebraic complexity. In Proceedings of MFCS, volume 2136 of Lecture Notes in Computer Science, 2001.

    Google Scholar 

  4. S. Kamienny. Torsion points on elliptic curves and q-coefficients of modular forms. Inventiones Mathematicae, 109:221–229, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  5. Richard J. Lipton. Straight-line complexity and integer factorization. In Algorithmic number theory (Ithaca, NY, 1994), pages 71–79, Berlin, 1994. Springer.

    Google Scholar 

  6. D. W. Masser. Counting points of small height on elliptic curves. Bull. Soc. Math. France, 117(2):247–265, 1989.

    MATH  MathSciNet  Google Scholar 

  7. B. Mazur. Rational isogenies of prime degree. Invent. Math., 44, 1978.

    Google Scholar 

  8. L. Merel. Bounds for the torsion of elliptic curves over number fields. Invent. Math., 124(1–3):437–449, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  9. P. Parent. Effective bounds for the torsion of elliptic curves over number fields. J. Reine Angew. Math, 506:85–116, 1999.

    MATH  MathSciNet  Google Scholar 

  10. Alice Silverberg. Open questions in arithmetic algebraic geometry. In Arithmetic Algebraic Geometry (Park City, UT, 1999), volume 9 of Institute for Advanced Study/Park City Mathematics Series, pages 83–142. American Mathematical Society, 2001.

    Google Scholar 

  11. J.H. Silverman. The arithmetic of elliptic curves. Springer-Verlag, 1986.

    Google Scholar 

  12. S. Smale. Mathematical problems for the next century. In V. Arnold, M. Atiyah, P. Lax, and B. Mazur, editors, Mathematics: Frontiers and Perspectives, 2000. AMS, 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cheng, Q. (2002). Some Remarks on the L-Conjecture. In: Bose, P., Morin, P. (eds) Algorithms and Computation. ISAAC 2002. Lecture Notes in Computer Science, vol 2518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36136-7_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-36136-7_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00142-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics