Francini, Paolo The size function \(h^0\) for quadratic number fields. (English) Zbl 1060.11076 J. Théor. Nombres Bordx. 13, No. 1, 125-135 (2001). Summary: We study the quadratic case of a conjecture made by G. van der Geer and R. Schoof [Sel. Math., New Ser. 6, No. 4, 377–398 (2000; Zbl 1030.11063)] about the behaviour of certain functions which are defined over the group of Arakelov divisors of a number field. These functions correspond to the standard function \(h^0\) for divisors of algebraic curves and we prove that they reach their maximum value for principal Arakelov divisors and nowhere else. Moreover, we consider a function \(\widetilde {k^0}\), which is an analogue of \(\exp h^0\) defined on the class group, and we show it also assumes its maximum at the trivial class. Cited in 2 ReviewsCited in 4 Documents MSC: 11R47 Other analytic theory 11R04 Algebraic numbers; rings of algebraic integers Citations:Zbl 1030.11063 PDF BibTeX XML Cite \textit{P. Francini}, J. Théor. Nombres Bordx. 13, No. 1, 125--135 (2001; Zbl 1060.11076) Full Text: DOI Numdam EuDML EMIS OpenURL References: [1] Banaszczyk, W., New bounds in some transference theorems in the geometry of numbers. Math. Ann.296 (1993), 625-635. · Zbl 0786.11035 [2] Borisov, A., Convolution structures and arithmetic cohomology. Math. AG/9807151 at http://xxx.lanl.gov, 1998. · Zbl 1158.11340 [3] Van Der Geer, G., Schoof, R., Effectivity of Arakelov divisors and the theta divisor of a number field. Math. AG/9802121 at http://xxx.lanl.gov, 1999. · Zbl 1030.11063 [4] Groenewegen, R.P., The size function for number fields. Doctoraalscriptie, Universiteit van Amsterdam, 1999. [5] Rose, H.E., A course in number theory. Oxford University Press, 1988. · Zbl 0637.10002 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.