Search arXivSearch

arXiv · 1505.00021

Explicit arithmetic of Jacobians of generalized Legendre curves over global function fields

Abstract

We study the Jacobian $J$ of the smooth projective curve $C$ of genus $r-1$ with affine model $y^r = x^{r-1}(x + 1)(x + t)$ over the function field $\mathbb{F}_p(t)$, when $p$ is prime and $r\ge 2$ is an integer prime to $p$. When $q$ is a power of $p$ and $d$ is a positive integer, we compute the $L$-function of $J$ over $\mathbb{F}_q(t^{1/d})$ and show that the Birch and Swinnerton-Dyer conjecture holds for $J$ over $\mathbb{F}_q(t^{1/d})$. When $d$ is divisible by $r$ and of the form $p^ν+1$, and $K_d := \mathbb{F}_p(μ_d,t^{1/d})$, we write down explicit points in $J(K_d)$, show that they generate a subgroup $V$ of rank $(r-1)(d-2)$ whose index in $J(K_d)$ is finite and a power of $p$, and show that the order of the Tate-Shafarevich group of $J$ over $K_d$ is $[J(K_d):V]^2$. When $r>2$, we prove that the "new" part of $J$ is isogenous over $\overline{\mathbb{F}_p(t)}$ to the square of a simple abelian variety of dimension $ϕ(r)/2$ with endomorphism algebra $\mathbb{Z}[μ_r]^+$. For a prime $\ell$ with $\ell \nmid pr$, we prove that $J[\ell](L)=\{0\}$ for any abelian extension $L$ of $\overline{\mathbb{F}}_p(t)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lisa Berger, Chris Hall, René Pannekoek, Jennifer Park, Rachel Pries, Shahed Sharif, Alice Silverberg, Douglas Ulmer. 2017-05-11. Explicit arithmetic of Jacobians of generalized Legendre curves over global function fields. https://arxiv.org/abs/1505.00021

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