Search arXivSearch

arXiv · 2409.00891

Shadow line distributions

Abstract

Let $E$ be an elliptic curve over $\mathbb{Q}$ with Mordell--Weil rank $2$ and $p$ be an odd prime of good ordinary reduction. For every imaginary quadratic field $K$ satisfying the Heegner hypothesis, there is (subject to the Shafarevich--Tate conjecture) a line, i.e., a free $\mathbb{Z}_p$-submodule of rank $1$, in $ E(K)\otimes \mathbb{Z}_p$ given by universal norms coming from the Mordell--Weil groups of subfields of the anticyclotomic $\mathbb{Z}_p$-extension of $K$; we call it the {\it shadow line}. When the twist of $E$ by $K$ has analytic rank $1$, the shadow line is conjectured to lie in $E(\mathbb{Q})\otimes\mathbb{Z}_p$; we verify this computationally in all our examples. We study the distribution of shadow lines in $E(\mathbb{Q})\otimes\mathbb{Z}_p$ as $K$ varies, framing conjectures based on the computations we have made.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jennifer S. Balakrishnan, Mirela Çiperiani, Barry Mazur, Karl Rubin. 2025-05-12. Shadow line distributions. https://arxiv.org/abs/2409.00891

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