Search arXivSearch

arXiv · 2608.13371

Gross vectors modulo 2 and elliptic curves of prime conductor

Abstract

Let p > 3 be a prime, and let S_p denote the geometric isomorphism classes of supersingular elliptic curves in characteristic p whose j-invariants lie in F_p. For each negative fundamental discriminant -D for which p is inert in Q(sqrt(-D)), let m_i(D), i in S_p, be the integral coefficients of the corresponding Gross vector. We prove that the vectors (m_i(D) mod 2)_{i in S_p} span F_2^{S_p}. The key step reduces the parity of the representation numbers of Gross's ternary lattices to representation by rank-two sublattices perpendicular to Frobenius. Using Ibukiyama's explicit maximal orders, the resulting primitive binary forms are identified with those occurring in the Xiao--Zhou--Deng--Qu parametrization of supersingular elliptic curves over F_p. Class field theory and Chebotarev's theorem then allow the individual supersingular coordinates to be isolated. As a consequence, if E/Q has prime conductor p and positive Mordell--Weil rank, then every coefficient of its Brandt eigenvector indexed by S_p is even, proving a conjecture of Kazalicki and Kohen. Thus an odd coefficient at a rational supersingular class is an algebraic certificate of rank 0. Combining this parity theorem with formulas of Mestre and Gross--Kudla, we also prove that the modular degree of every positive-rank elliptic curve of prime conductor and root number +1 is divisible by 4. Consequently, Watkins' conjecture holds for all such curves of rank 2.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Matija Kazalicki, Siniša Slijepčević. 2026-08-13. Gross vectors modulo 2 and elliptic curves of prime conductor. https://arxiv.org/abs/2608.13371

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