2017
DOI: 10.2140/ant.2017.11.1739
|View full text |Cite
|
Sign up to set email alerts
|

On ℓ-torsion in class groups of number fields

Abstract: For each integer ℓ ≥ 1, we prove an unconditional upper bound on the size of the ℓ-torsion subgroup of the class group, which holds for all but a zero-density set of field extensions of Q of degree d, for any fixed d ∈ {2, 3, 4, 5} (with the additional restriction in the case d = 4 that the field be non-D 4 ). For sufficiently large ℓ (specified explicitly), these results are as strong as a previously known bound that is conditional on GRH. As part of our argument, we develop a probabilistic "Chebyshev sieve,"… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

3
97
0
1

Year Published

2019
2019
2024
2024

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 45 publications
(101 citation statements)
references
References 40 publications
3
97
0
1
Order By: Relevance
“…proving (19). With Z := qX −1/d+η this simplifies to X In what follows we will choose Z = Z(q) := qX −1/d+η for a fixed small η > 0 so as to guarantee (20), so…”
Section: Lemmamentioning
confidence: 99%
See 1 more Smart Citation
“…proving (19). With Z := qX −1/d+η this simplifies to X In what follows we will choose Z = Z(q) := qX −1/d+η for a fixed small η > 0 so as to guarantee (20), so…”
Section: Lemmamentioning
confidence: 99%
“…For each squarefree integer q, we require estimates for the number of x ∈ A(X) bad at each prime dividing q. These may be obtained via the geometry of numbers (see, among other references, [17,1,3,9,13,19]) or using Shintani zeta functions [27], and we develop a third (simpler) method here.…”
mentioning
confidence: 99%
“…Cl= [9,3,3,3,3,3] We publish, for any further examples, a program computing all the cyclic cubic fields such that there are exceptional 3-classes; so in most cases the 3-rank is N (instead of N − 1) and many examples have a non-trivial 9-rank. 9)==3,a=-a); P=x^3-f/3*x-f*a/27);N=omega(f);L=List;K=bnfinit(P,1);C8=component(K,8); h=component(component(C8,1),1);Cl=component(component(C8,1),2); dim=component(matsize(Cl),2);rho=0;for(i=1,dim,z=component(Cl,i); v=valuation(z,3);if(v>=1,rho=rho+1;listput(L,3^v)));if(rho>=N, print(" f=",f," N=",N," P=",P," Cl=",L)))))} f=657 N=2 P=x^3-219*x-1241 Cl= [3,3] f=657 N=2 P=x^3-219*x+730…”
Section: 22mentioning
confidence: 99%
“…Computation of C K,p for imaginary quadratic fields. We shall illustrate the cases p = 2, then p = 3, in various intervals of negative discriminants to observe the local decreasing of the variable C K,p (9). Note that for p > 3, the group W K is trivial contrary to the cases p = 2 and 3 where W K may be Z/pZ, which must probably be discarded in our considerations.…”
mentioning
confidence: 94%
“…Theorem 7.4 can be proven by the same method as Theorem 2.3. Such a bound however is only known for powers of two and conjectured otherwise (see for instance [16]).…”
Section: Equidistribution Of Large Subcollectionsmentioning
confidence: 99%