Skip to main content
SpringerLink
Log in

Gauss Composition and Generalizations

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

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

Included in the following conference series:

Abstract

We discuss several higher analogues of Gauss composition and consider their potential algorithmic applications.

I am very grateful to Professors Andrew Wiles and Peter Sarnak for all their enthusiasm and encouragement, and to Jonathan Hanke, Kiran Kedlaya, and Lenny Ng for helpful comments on an earlier draft of this paper. This work was supported by the Hertz Foundation and the Clay Mathematics Institute, and was conducted at Princeton University.

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

Access this chapter

Log in via an institution
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. K. Belabas, A fast algorithm to compute cubic fields, Math. Comp. 66 (1997), no. 219, 1213–1237.

    Article  MATH  MathSciNet  Google Scholar 

  2. M. Bhargava, Higher Composition Laws, Ph. D. Thesis, Princeton University, 2001.

    Google Scholar 

  3. M. Bhargava, Higher composition laws I-V, in progress.

    Google Scholar 

  4. D. Buell, Binary quadratic forms. Classical theory and modern computations, Springer-Verlag, New York, 1989.

    MATH  Google Scholar 

  5. H. Cohen, A course in computational algebraic number theory, Graduate Texts in Mathematics 138, Springer-Verlag, Berlin, 1993.

    Google Scholar 

  6. H. Cohen, Advanced topics in computational number theory, Graduate Texts in Mathematics 193, Springer-Verlag, New York, 2000.

    Google Scholar 

  7. H. Davenport and H. Heilbronn, On the density of discriminants of cubic fields II, Proc. Roy. Soc. London Ser. A 322 (1971), no. 1551, 405–420.

    Google Scholar 

  8. B. N. Delone and D. K. Faddeev, The theory of irrationalities of the third degree, AMS Translations of Mathematical Monographs 10, 1964.

    Google Scholar 

  9. C. F. Gauss, Disquisitiones Arithmeticae, 1801.

    Google Scholar 

  10. C. Hermite, Sur la réduction des formes cubiques à deux indéterminées, C. R. Acad. Sci. Paris 48 (1859), 351–357.

    Google Scholar 

  11. G. B. Mathews and W. E. H. Berwick, On the reduction of arithmetical binary cubics which have a negative determinant, Proc. Lond. Math. Soc. (2) 10 (1912), 48–53.

    Article  Google Scholar 

  12. M. Sato and T. Kimura, A classification of irreducible prehomogeneous vector spaces and their relative invariants, Nagoya Math. J. 65 (1977), 1–155.

    MATH  MathSciNet  Google Scholar 

  13. A. Seidenberg, A new decision method for elementary algebra, Ann. Math. 60 (1954), 365–374.

    Article  MathSciNet  Google Scholar 

  14. C. L. Siegel, The average measure of quadratic forms with given determinant and signature, Ann. Math. (2) 45 (1944), 667–685.

    Article  Google Scholar 

  15. A. Tarski, A decision method for elementary algebra and geometry, 2nd ed., revised, Berkeley and Los Angeles, 1951.

    Google Scholar 

  16. D. J. Wright and A. Yukie, Prehomogeneous vector spaces and field extensions, Invent. Math. 110 (1992), 283–314.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Clay Mathematics Institute, Princeton University, USA

    Manjul Bhargava

Authors
  1. Manjul Bhargava
    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

Bhargava, M. (2002). Gauss Composition and Generalizations. 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_1

Download citation

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

  • 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

Search

Navigation