Search arXivSearch

arXiv · 1508.00676

Rank gain of Jacobians over finite Galois extensions

Abstract

Let $\mathcal{X}$ be a Riemann surface of genus $g>0$ defined over a number field $K$ which is a degree $d$-covering of $\mathbb{P}^1_K$. In this paper we show the existence of infinitely many linearly disjoint degree $d$-extensions $L/K$ over which the Jacobian of $\mathcal{X}$ gains rank. In the case where 0, 1 and $\infty$ are the only branch points, and there is an automorphism $σ$ of $\mathcal{X}$ which cyclically permutes these branch points, we obtain the same result for the Jacobian of $\mathcal{X}/σ$. In particular if $\mathcal{X}$ is the Klein quartic, then the construction provides an elliptic curve which gains rank over infinitely many degree $7$-extensions of $\mathbb{Q}$. As an application, we show the existence of infinitely many elliptic curves that gain rank over infinitely many cyclic cubic extensions of $\mathbb{Q}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bo-Hae Im, Erik Wallace. 2016-12-09. Rank gain of Jacobians over finite Galois extensions. https://arxiv.org/abs/1508.00676

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