Search arXivSearch

arXiv · 2110.02371

Rational points on algebraic curves in infinite towers of number fields

Abstract

We study a natural question in the Iwasawa theory of algebraic curves of genus $>1$. Fix a prime number $p$. Let $X$ be a smooth, projective, geometrically irreducible curve defined over a number field $K$ of genus $g>1$, such that the Jacobian of $X$ has good ordinary reduction at the primes above $p$. Fix an odd prime $p$ and for any integer $n>1$, let $K_n^{(p)}$ denote the degree-$p^n$ extension of $K$ contained in $K(μ_{p^{\infty}})$. We prove explicit results for the growth of $\#X(K_n^{(p)})$ as $n\rightarrow \infty$. When the Jacobian of $X$ has rank zero and the associated adelic Galois representation has big image, we prove an explicit condition under which $X(K_{n}^{(p)})=X(K)$ for all $n$. This condition is illustrated through examples. We also prove a generalization of Imai's theorem that applies to abelian varieties over arbitrary pro-$p$ extensions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anwesh Ray. 2022-03-26. Rational points on algebraic curves in infinite towers of number fields. https://doi.org/10.1007/s11139-022-00583-3

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