Algorithmic Algebraic Number Theory

✍ Scribed by M. Pohst, H. Zassenhaus

• Publisher: Cambridge University Press
• Year: 1997
• Tongue: English
• Leaves: 512
• Series: Encyclopedia of Mathematics and its Applications; 30
• Edition: 1
• Category: Library

✦ Synopsis

This classic book gives a thorough introduction to constructive algebraic number theory, and is therefore especially suited as a textbook for a course on that subject. It also provides a comprehensive look at recent research. For experimental number theoreticians, the authors developed new methods and obtained new results of great importance for them. Both computer scientists interested in higher arithmetic and those teaching algebraic number theory will find the book of value.

✦ Table of Contents

Contents
Preface
List of symbols used in the text
1 Basics of constructive algebraic number theory
2 The group of an equation
3 Methods from the geometry of numbers
4 Embedding of commutative orders into the maximal order
5 Units in algebraic number fields
6 The class group of algebraic number fields
7 Recent developments
Appendix: Numerical tables
Algorithms
References
Index