Search arXivSearch

arXiv · 2301.09760

Density of Selmer ranks in families of even Galois representations, Wiles' formula, and global reciprocity

Abstract

This paper concerns the distribution of Selmer ranks in a family of even Galois representations in even residual characteristic obtained by allowing ramification at auxiliary primes. The main result is a Galois cohomological analogue of a theorem of Friedlander, Iwaniec, Mazur and Rubin on the distribution of Selmer ranks in a family of twists of elliptic curves. The Selmer groups are constructed as prescribed by the Galois cohomological method for GL(2): At each ramified place, the local Selmer condition is the tangent space of a smooth quotient of the local deformation ring. By methods of global class field theory, the Selmer group at the minimal level is computed explicitly. The infinitude of primes for which the Selmer rank increases by one is proved, and the density of such primes is shown to be 1/192. The proof combines Wiles' formula and the global reciprocity law. The result has implications for the algebraic structure of even deformation rings and the distribution of their presentations in families.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Peter Vang Uttenthal. 2023-08-24. Density of Selmer ranks in families of even Galois representations, Wiles' formula, and global reciprocity. https://doi.org/10.1016/j.jnt.2023.11.010

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT