Graduate Texts in Mathematics

Advanced Topics in Computational Number Theory

Authors: Cohen, Henri

Buy this book

eBook $69.99
price for USA (gross)
  • ISBN 978-1-4419-8489-0
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $89.99
price for USA
  • ISBN 978-0-387-98727-9
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $89.99
price for USA
  • ISBN 978-1-4612-6419-4
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this Textbook

The computation of invariants of algebraic number fields such as integral bases, discriminants, prime decompositions, ideal class groups, and unit groups is important both for its own sake and for its numerous applications, for example, to the solution of Diophantine equations. The practical com­ pletion of this task (sometimes known as the Dedekind program) has been one of the major achievements of computational number theory in the past ten years, thanks to the efforts of many people. Even though some practical problems still exist, one can consider the subject as solved in a satisfactory manner, and it is now routine to ask a specialized Computer Algebra Sys­ tem such as Kant/Kash, liDIA, Magma, or Pari/GP, to perform number field computations that would have been unfeasible only ten years ago. The (very numerous) algorithms used are essentially all described in A Course in Com­ putational Algebraic Number Theory, GTM 138, first published in 1993 (third corrected printing 1996), which is referred to here as [CohO]. That text also treats other subjects such as elliptic curves, factoring, and primality testing. Itis important and natural to generalize these algorithms. Several gener­ alizations can be considered, but the most important are certainly the gen­ eralizations to global function fields (finite extensions of the field of rational functions in one variable overa finite field) and to relative extensions ofnum­ ber fields. As in [CohO], in the present book we will consider number fields only and not deal at all with function fields.

Table of contents (12 chapters)

  • Fundamental Results and Algorithms in Dedekind Domains

    Cohen, Henri

    Pages 1-47

  • Basic Relative Number Field Algorithms

    Cohen, Henri

    Pages 49-132

  • The Fundamental Theorems of Global Class Field Theory

    Cohen, Henri

    Pages 133-162

  • Computational Class Field Theory

    Cohen, Henri

    Pages 163-222

  • Computing Defining Polynomials Using Kummer Theory

    Cohen, Henri

    Pages 223-295

Buy this book

eBook $69.99
price for USA (gross)
  • ISBN 978-1-4419-8489-0
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $89.99
price for USA
  • ISBN 978-0-387-98727-9
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $89.99
price for USA
  • ISBN 978-1-4612-6419-4
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Advanced Topics in Computational Number Theory
Authors
Series Title
Graduate Texts in Mathematics
Series Volume
193
Copyright
2000
Publisher
Springer-Verlag New York
Copyright Holder
Springer Science+Business Media New York
eBook ISBN
978-1-4419-8489-0
DOI
10.1007/978-1-4419-8489-0
Hardcover ISBN
978-0-387-98727-9
Softcover ISBN
978-1-4612-6419-4
Series ISSN
0072-5285
Edition Number
1
Number of Pages
XV, 581
Topics