Papers › Computing isolated coefficients of the j-function
Computing isolated coefficients of the j-function
Fredrik Johansson
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We consider the problem of efficiently computing isolated coefficients cₙ in the Fourier series of the elliptic modular function j(τ). We show that a hybrid numerical-modular method with complexity n¹⁺ᵒ⁽¹⁾ is efficient in practice. As an application, we locate the first few values of cₙ that are prime, the first occurring at n = 457871.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections