2014
DOI: 10.4064/aa164-4-4
|View full text |Cite
|
Sign up to set email alerts
|

Class numbers of totally real fields and applications to the Weber class number problem

Abstract: The determination of the class number of totally real fields of large discriminant is known to be a difficult problem. The Minkowski bound is too large to be useful, and the root discriminant of the field can be too large to be treated by Odlyzko's discriminant bounds. We describe a new technique for determining the class number of such fields, allowing us to attack the class number problem for a large class of number fields not treatable by previously known methods. We give an application to Weber's class num… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
35
0
1

Year Published

2015
2015
2024
2024

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 23 publications
(36 citation statements)
references
References 6 publications
0
35
0
1
Order By: Relevance
“…For our purposes, we need h + (m) not to be very big. For all power-of-two m up to m = 256, and also for m = 512 under GRH, it is known that h + (m) = 1 (see [Mil14]). Whether h + (m) = 1 for all power-of-two m is known as Weber's class number problem, and is presented in the literature as a reasonable conjecture.…”
Section: Cyclotomic Number Fields and The Log-unit Latticementioning
confidence: 99%
“…For our purposes, we need h + (m) not to be very big. For all power-of-two m up to m = 256, and also for m = 512 under GRH, it is known that h + (m) = 1 (see [Mil14]). Whether h + (m) = 1 for all power-of-two m is known as Weber's class number problem, and is presented in the literature as a reasonable conjecture.…”
Section: Cyclotomic Number Fields and The Log-unit Latticementioning
confidence: 99%
“…However, the root discriminant of B 13,1 is too large for the class number to be calculated unconditionally using van der Linden's methods, and the field B 17,1 has root discriminant too large to be treated by those methods, even under the assumption of GRH. In the author's recent paper [15], an analytic class number upper bound was developed that employed counting prime ideals of the Hilbert class field. Using this new bound, it is possible to unconditionally determine the class number of number fields of discriminant too large to have been treated by previously known methods.…”
Section: New Results On Certain B B B Pnmentioning
confidence: 99%
“…The strategy is to find sufficiently many generators of totally split principal prime ideals, so that we have sufficiently many primes to include in our set S. Then we can apply the lemma and establish an upper bound for the class number. The reader is invited to consult [15] for more details regarding this method.…”
Section: Lemma 1 (See Millermentioning
confidence: 99%
See 1 more Smart Citation
“…Later, several authors showed h n = 1 for (p, n) = (2, 4), (2,5), (3,1), (3,2), (3,3), (5,1) and (7, 1) (see [1], [3], [18] and [19]). And recently, J. C. Miller obtained striking results determining h n = 1 for (p, n) = (2, 6), (5,2), (11,1), (13,1), (17,1) and (19,1) (see [20] and [21]). However, calculating one class number by one gives information on the class numbers for only finitely many layers.…”
Section: Introductionmentioning
confidence: 99%