+612 9045 4394
 
CHECKOUT
Advanced Topics in Computional Number Theory : Graduate Texts in Mathematics - Henri Cohen

Advanced Topics in Computional Number Theory

Graduate Texts in Mathematics

Hardcover Published: 30th November 1999
ISBN: 9780387987279
Number Of Pages: 581

Share This Book:

Hardcover

$147.02
or 4 easy payments of $36.76 with Learn more
Ships in 7 to 10 business days

Earn 294 Qantas Points
on this Book

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.

Industry Reviews

"Das vorliegende Buch ist eine Fortsetzung des bekannten erkes "A Course in Computational Algebraic Number Theory" (Graduate Texts in Mathematics 138) desselben Autors. ...
So ist das vorliegende Buch ein sehr umfangliches Nachschlagewerk zur algorithmischen Zahlentheorie, das zusammen mit dem ersten Buch des Autors sicherlich eine Standard-Referenz fur zahlentheoretische Algorithmen darstellen wird."
Internationale Mathematische Nachrichten, Nr. 187, August 2001

Fundamental Results and Algorithms in Dedekind domains
Basic Relative Number Field Algorithms
The Fundamental Theorems of Global Class Field Theory
Computational Class Field Theory
Computing Defining Equations
Cubic Number Fields
Ramification, Conductors and Discriminants
Relative Class Groups, Units and Regulators
Inverting Prime Ideals
Algorithms for p-adic fields
Table of Contents provided by Publisher. All Rights Reserved.

ISBN: 9780387987279
ISBN-10: 0387987274
Series: Graduate Texts in Mathematics
Audience: General
Format: Hardcover
Language: English
Number Of Pages: 581
Published: 30th November 1999
Publisher: Springer-Verlag New York Inc.
Country of Publication: US
Dimensions (cm): 24.26 x 16.26  x 3.2
Weight (kg): 0.96

Earn 294 Qantas Points
on this Book