Simple Search

Query:

Enter a query and click »Search«...

Format:

Display: entries per page entries

Zbl 1188.11076
Schoof, René
Computing Arakelov class groups. (English)
[A] Buhler, J. P. (ed.) et al., Algorithmic number theory. Lattices, number fields, curves and cryptography. Cambridge: Cambridge University Press. Mathematical Sciences Research Institute Publications 44, 447-495 (2008). ISBN 978-0-521-80854-5/hbk

The author studies Arakelov divisors and Arakelov class groups in number fields. He demonstrates that this concept is a natural generalization of the much earlier ``infrastructure'' theory of Shanks for quadratic number fields. He also shows that Buchmann's algorithm for calculating the class group and the regulator of a number field (which has subexponential running time under reasonable assumptions) can be deduced from his Arakelov point of view. A major part of the article treats the development of a ``geometry of numbers'' for Arakelov divisors leading to the concept of reduction. In the last three sections computational aspects are considered and a deterministic algorithm for the calculation of the Arakelov class group of a number field is presented.
[Michael Pohst (Berlin)]

MSC 2000:: *11Y40 Algebraic number theory computations
14G40 Arithmetic varieties and schemes

Keywords: Arakelov class groups; class group computation

Cited in: Zbl 1205.11124

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Simple Search

Zentralblatt MATH Berlin [Germany]