Search arXivSearch

arXiv · 2107.03064

On the Mordell--Weil lattice of $y^2 = x^3 + b x + t^{3^n + 1}$ in characteristic $3$

Abstract

We study the elliptic curves given by $y^2 = x^3 + b x + t^{3^n+1}$ over global function fields of characteristic $3$; in particular we perform an explicit computation of the $L$-function by relating it to the zeta function of a certain superelliptic curve $u^3 + b u = v^{3^n + 1}$. In this way, using the Néron-Tate height on the Mordell--Weil group, we obtain lattices in dimension $2 \cdot 3^n$ for every $n \geq 1$, which improve on the currently best known sphere packing densities in dimensions 162 (case $n=4$) and 486 (case $n=5$). For $n=3$, the construction has the same packing density as the best currently known sphere packing in dimension $54$, and for $n=1$ it has the same density as the lattice $E_6$ in dimension $6$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gauthier Leterrier. 2022-03-27. On the Mordell--Weil lattice of $y^2 = x^3 + b x + t^{3^n + 1}$ in characteristic $3$. https://doi.org/10.1007/s40993-022-00321-0

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