Advanced Topics in Computational Number Theory
β Scribed by Henri Cohen
- Publisher
- Springer
- Year
- 2000
- Tongue
- English
- Leaves
- 599
- Series
- Graduate texts in mathematics 193
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Synopsis
Written by an authority with great practical and teaching experience in the field, this book addresses a number of topics in computational number theory. Chapters one through five form a homogenous subject matter suitable for a six-month or year-long course in computational number theory. The subsequent chapters deal with more miscellaneous subjects.
β¦ Table of Contents
Front Matter....Pages i-xv
Fundamental Results and Algorithms in Dedekind Domains....Pages 1-47
Basic Relative Number Field Algorithms....Pages 49-132
The Fundamental Theorems of Global Class Field Theory....Pages 133-162
Computational Class Field Theory....Pages 163-222
Computing Defining Polynomials Using Kummer Theory....Pages 223-295
Computing Defining Polynomials Using Analytic Methods....Pages 297-346
Variations on Class and Unit Groups....Pages 347-387
Cubic Number Fields....Pages 389-428
Number Field Table Constructions....Pages 429-473
Appendix A: Theoretical Results....Pages 475-521
Appendix B: Electronic Information....Pages 523-531
Appendix C: Tables....Pages 533-548
Back Matter....Pages 549-581
β¦ Subjects
complexiteΜ algorithme;corps fini;domaine Dedekind;theΜorie nombre;Nombres, TheΜorie des -- Informatique;Algorithmes;Corps de classe
π SIMILAR VOLUMES
Written by an authority with great practical and teaching experience in the field, this book addresses a number of topics in computational number theory. Chapters one through five form a homogenous subject matter suitable for a six-month or year-long course in computational number theory. The subseq
<p>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Β
Written by an authority with great practical and teaching experience in the field, this book addresses a number of topics in computational number theory. Chapters one through five form a homogenous subject matter suitable for a six-month or year-long course in computational number theory. The subseq
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 Cl
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- pl