Search arXivSearch

arXiv · 2607.02678

Recovering Kodaira types from $\ell$-torsion on elliptic curves

Abstract

The classical Néron-Ogg-Shafarevich criterion characterises good reduction of an elliptic curve $E$ over a $p$-adic field via the action of inertia on the $\ell$-adic Tate module. However, the action of inertia on $E[\ell]$ is not sufficient to distinguish between potentially good and multiplicative reduction, and the action on $T_{\ell}(E)$ is not sufficient to determine the Kodaira type. We remedy this situation by endowing $E[\ell]$ with a distance function that records the $p$-adic distances between the $x$-coordinates of the points. We show that, equipped with this additional structure, $E[\ell]$ determines the Kodaira type of the elliptic curve. In the case of residue characteristic $2$, we assume that $E$ does not have potentially good reduction of type $I_n^*$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Naina Praveen. 2026-07-02. Recovering Kodaira types from $\ell$-torsion on elliptic curves. https://arxiv.org/abs/2607.02678

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