Search arXivSearch

arXiv · 2603.29789

From Orientations to $\ell$-adic Period Vectors

Abstract

We propose a bridge between oriented supersingular elliptic curves and the arithmetic of modular curves. To an $\mathcal{O}$-oriented supersingular curve, we attach a class in the relative homology group $H(X_0(N),C,\mathbb{Z})$, i.e. modular symbols, compatible with the Hecke action. We then compute vectors of $\ell$-adic periods by pairing with weight $2$ cusp forms via Coleman integration. This yields an explicit, computable map from short combinatorial homology representatives to truncated vectors in $(\mathbb{Z}/\ell^m\mathbb{Z})^d$. Motivated by this encoding, we formulate the Modular Symbol Inversion (MSI) problem -- recovering a short homology representative from its truncated $\ell$-adic period data -- and discuss its arithmetic structure, its relation to path problems on isogeny graphs and Bruhat-Tits trees, and potential applications to cryptographic constructions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Leonardo Colò. 2026-03-31. From Orientations to $\ell$-adic Period Vectors. https://arxiv.org/abs/2603.29789

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