Search arXivSearch

arXiv · 2608.13202

Infinitely many elliptic curves over $\mathbb{Q}(i)$ of exact ranks 4 and 6 with $j$-invariant 1728

Abstract

For each $r\in\{4,6\}$, we construct an explicit one-parameter family of elliptic curves over $\mathbb{Q}(i)$ containing infinitely many pairwise nonisomorphic curves genuinely defined over $\mathbb{Q}(i)$ with $j$-invariant $1728$ and rank exactly $r$. We construct explicit $\mathbb{Q}(i)$-rational points to bound the ranks from below. Kai's theorem on prime values of linear patterns over number fields provides specializations with controlled local behavior, allowing us to obtain matching upper bounds via $[1+i]$-descent. The construction extends the strategy of the author's earlier rank-$2$ paper by replacing a symmetric Gaussian-prime configuration with systems of binary linear forms satisfying several complementary square identities. In the rank-$6$ case, the support vectors attached to the three constructed points and $(0,0)$ span the self-dual Reed-Muller code $\mathrm{RM}(1,3)$, which also occurs as the kernel of the quadratic-residue Laplacian governing the Selmer group.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ben Savoie. 2026-08-13. Infinitely many elliptic curves over $\mathbb{Q}(i)$ of exact ranks 4 and 6 with $j$-invariant 1728. https://arxiv.org/abs/2608.13202

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