Results 1 
6 of
6
Algorithms in algebraic number theory
 Bull. Amer. Math. Soc
, 1992
"... Abstract. In this paper we discuss the basic problems of algorithmic algebraic number theory. The emphasis is on aspects that are of interest from a purely mathematical point of view, and practical issues are largely disregarded. We describe what has been done and, more importantly, what remains to ..."
Abstract

Cited by 42 (4 self)
 Add to MetaCart
Abstract. In this paper we discuss the basic problems of algorithmic algebraic number theory. The emphasis is on aspects that are of interest from a purely mathematical point of view, and practical issues are largely disregarded. We describe what has been done and, more importantly, what remains to be done in the area. We hope to show that the study of algorithms not only increases our understanding of algebraic number fields but also stimulates our curiosity about them. The discussion is concentrated of three topics: the determination of Galois groups, the determination of the ring of integers of an algebraic number field, and the computation of the group of units and the class group of that ring of integers. 1.
Approximating Rings of Integers in Number Fields
, 1994
"... In this paper we study the algorithmic problem of finding the ring of integers of a given algebraic number field. In practice, this problem is often considered to be wellsolved, but theoretical results indicate that it is intractable for number fields that are defined by equations with very large ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
In this paper we study the algorithmic problem of finding the ring of integers of a given algebraic number field. In practice, this problem is often considered to be wellsolved, but theoretical results indicate that it is intractable for number fields that are defined by equations with very large coefficients. Such fields occur in the number field sieve algorithm for factoring integers. Applying a variant of a standard algorithm for finding rings of integers, one finds a subring of the number field that one may view as the "best guess" one has for the ring of integers. This best guess is probably often correct. Our main concern is what can be proved about this subring. We show that it has a particularly transparent local structure, which is reminiscent of the structure of tamely ramified extensions of local fields. A major portion of the paper is devoted to the study of rings that are "tame" in our more general sense. As a byproduct, we prove complexity results that elaborate upon a ...
The Totally Real A_5 Extension of Degree 6 with Minimum Discriminant
 Math
, 1998
"... CONTENTS 1. Introduction 2. Generation of Polynomials 3. Processing of Generated Polynomials 4. Summary of Results References Research supported by the Natural Sciences and Engineering Research Council (Canada) and Fonds pour la Formation de Chercheurs et l'Aide `a la Recherche (Quebec). We d ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
CONTENTS 1. Introduction 2. Generation of Polynomials 3. Processing of Generated Polynomials 4. Summary of Results References Research supported by the Natural Sciences and Engineering Research Council (Canada) and Fonds pour la Formation de Chercheurs et l'Aide `a la Recherche (Quebec). We determine the totally real algebraic number field F of degree 6 with Galois group A 5 and minimum discriminant, showing that it is unique up to isomorphism and that it is generated by a root of the polynomial f(t) = t 6 \Gamma 10t 4 + 7t 3 + 15t 2 \Gamma 14t + 3 over the rationals. We also list the fundamental units and class number of F , as well as data for several other fields that arose in our computations and that might be of interest. 1. INTRODUCTION The comput
ON INTEGRAL BASES IN RELATIVE QUADRATIC EXTENSIONS
, 1996
"... Let F be an algebraic number field and E a quadratic extension with E = F ( √ µ). We describe a minimal set of elements for generating the integral elements oE of E as an oF module. A consequence of this theoretical result is an algorithm for constructing such a set. The construction yields a sim ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Let F be an algebraic number field and E a quadratic extension with E = F ( √ µ). We describe a minimal set of elements for generating the integral elements oE of E as an oF module. A consequence of this theoretical result is an algorithm for constructing such a set. The construction yields a simple procedure for computing an integral basis of E as well. In the last section, we present examples of relative integral bases which were computed with the new algorithm and also give some running times.
Journal de Théorie des Nombres de Bordeaux 6 (1994), 221–260
"... Approximating rings of integers in number fields ..."