Approximating rings of integers in number fields (Q1805356): Difference between revisions

This is a nice survey on the problem of computing the maximal order \(o_F\) of an algebraic number field \(F\). Starting from a result of \textit{A. L. Chistov} [Sov. Math., Dokl. 39, No. 3, 597-600 (1989); English translation from Dokl. Akad. Nauk SSSR 306, No. 5, 1063-1067 (1989; Zbl 0698.12001)] the authors discuss polynomial time algorithms for constructing an order of \(F\) which is close to \(o_F\) in a precise sense. Unfortunately the presentation is not very well balanced. Whereas several sections contain basic material from textbooks, others cover new ground - - at least from an algorithmic point of view. Notions like ``factor refinement'' are adopted uncritically although these ideals are certainly not new. They already were published by \textit{H. Zassenhaus} in the seventies [Symp. Math. 15, Convegni 1973, 499-513 (1975; Zbl 0337.12014)]\ and are contained in textbooks since more than five years.