We present a new probabilistic algorithm to compute modular polynomials modulo a prime. Modular polynomials parameterize pairs of isogenous elliptic curves and are useful in many aspects of computational number theory and cryptography. Our algorithm has the distinguishing feature that it does not involve the computation of Fourier coefficients of modular forms. We avoid computing the exponentially large integral coefficients by working directly modulo a prime and computing isogenies between elliptic curves via Velu's formulas.
In this paper we give a closed form expression for the Drinfeld modular polynomial $Φ_T(X,Y) \in \mathbb{F}_q(T)[X,Y]$ for arbitrary $q$ and prove a conjecture of Schweizer. A new identity involving the Catalan numbers plays a central role.
Hecke eigenvalues of classical modular forms often encode a wealth of arithmetic data. The Satake $p$-parameters of a Siegel modular form play a role analogous to the one played by Hecke eigenvalues in the characterization of classical modular forms. In this paper we present an algorithm by which we can compute the Satake $p$-parameters of a Siegel modular form $F$ if we are given the Hecke eigenvalues of $F$ with respect to the generators of the local Hecke algebra. We compute explicit examples and relate our computations to the Ramanujan-Petersson Conjecture.
In previous work, the first author developed an algorithm for the computation of Hilbert modular forms. In this paper, we extend this to all totally real number fields of even degree and nontrivial class group. Using the algorithm over $\Q(\sqrt{10})$ and $\Q(\sqrt{85})$ and their Hilbert class fields, we present some new instances of the conjectural Eichler-Shimura construction for totally real fields, and in particular find new examples of modular abelian varieties with everywhere good reduction.
In this paper we present an algorithm for computing Hecke eigensystems of Hilbert-Siegel cusp forms over real quadratic fields of narrow class number one. We give some illustrative examples using the quadratic field $\Q(\sqrt{5})$. In those examples, we identify Hilbert-Siegel eigenforms that are possible lifts from Hilbert eigenforms.
In this paper, we introduce modular polynomials for the congruence subgroup $Γ_0(M)$ when $ X_0(M) $ has genus zero and therefore the polynomials are defined by a Hauptmodul of $ X_0(M) $. We show that the intersection number of two curves defined by two modular polynomials can be expressed as the sum of the numbers of $\mathrm{SL}_2(\mathbb{Z})$-equivalence classes of positive definite binary quadratic forms over $\mathbb{Z}$. We also show that the intersection numbers can be also combinatorially written by Fourier coefficients of the Siegel Eisenstein series of degree 2, weight 2 with respec…
Modular polynomials are an important tool in many algorithms involving elliptic curves. In this article we investigate their generalization to the genus 2 case following pioneering work by Gaudry and Dupont. We prove various properties of these genus 2 modular polynomials and give an improved way to explicitly compute them.
We utilize effective algorithms for computing in the cohomology of a Shimura curve together with the Jacquet-Langlands correspondence to compute systems of Hecke eigenvalues associated to Hilbert modular forms over a totally real field.
In the classical setting, the modular equation of level $N$ for the modular curve $X_0(1)$ is the polynomial relation satisfied by $j(τ)$ and $j(Nτ)$, where $j(τ)$ is the standard elliptic $j$-function. In this paper, we will describe a method to compute modular equations in the setting of Shimura curves. The main ingredient is the explicit method for computing Hecke operators on the spaces of modular forms on Shimura curves developed in [13].
We propose to generalize the work of Régis Dupont for computing modular polynomials in dimension $2$ to new invariants. We describe an algorithm to compute modular polynomials for invariants derived from theta constants and prove under some heuristics that this algorithm is quasi-linear in its output size. Some properties of the modular polynomials defined from quotients of theta constants are analyzed. We report on experiments with our implementation.
We construct plane models of the modular curve $X_H(\ell)$, and use their explicit equations to compute Galois representations associated to modular forms for values of $\ell$ that are significantly higher than in prior works.
We investigate a relationship between MacMahon's generalized sum-of-divisors functions and Chebyshev polynomials of the first kind. This determines a recurrence relation to compute these functions, as well as proving a conjecture of MacMahon about their general form by relating them to quasi-modular forms. These functions arise as solutions to a curve-counting problem on Abelian surfaces.
We exhibit a method to numerically compute power series expansions of modular forms on a cocompact Fuchsian group, using the explicit computation a fundamental domain and linear algebra.
In this paper we describe an algorithm for computing mod $\ell$ Galois representations associated to modular forms of weight $k$ when $\ell <k-1$. As applications, we use this algorithm to explicitly compute the cases with $Δ_{k}$ for $k=16,20, 22, 26$ and all the unexceptional primes $\ell$ with $\ell <k-1$.
We discuss practical and some theoretical aspects of computing a database of classical modular forms in the L-functions and Modular Forms Database (LMFDB).
We develop an algorithm to compute Fourier expansions of vector valued modular for Weil representations. As an application, we compute explicit linear equivalences of special divisors on modular varieties of orthogonal type. We define three families of Hecke operators for Jacobi forms, and analyze the induced action on vector valued modular forms. The newspaces attached to one of these families are used to give a more memory efficient version of our algorithm.
In this paper, we consider modular local polynomials. These functions satisfy modularity while they are locally defined as polynomials outside of an exceptional set. We prove an inequality for the dimension of the space of such forms when the exceptional set is given by certain natural geodesics related to binary quadratic forms of (positive) discriminant $D$. We furthermore show that the dimension is the largest possible if and only if $D$ is an even square. Following this, we describe how to use the methods developped in this paper to establish an algorithm which explicitly determines the sp…
In this paper, we study how small a box contains at least two points from a modular cubic polynomial $y \equiv a x^3 + b x^2 + c x + d \pmod p$ with $(a, p) = 1$. We prove that some square of side length $p^{1/6 + ε}$ contains two such points.
We develop a new algorithm to compute a basis for $M_k(Γ_0(N))$, the space of weight $k$ holomorphic modular forms on $Γ_0(N)$, in the case when the graded algebra of modular forms over $Γ_0(N)$ is generated at weight two. Our tests show that this algorithm significantly outperforms a commonly used algorithm which relies more heavily on modular symbols.
Let $p\geq 5$ be a prime number. We generalize the results of E. de Shalit about supersingular $j$-invariants in characteristic $p$. We consider supersingular elliptic curves with a basis of $2$-torsion over $\overline{\mathbf{F}}_p$, or equivalently supersingular Legendre $λ$-invariants. Let $F_p(X,Y) \in \mathbf{Z}[X,Y]$ be the $p$-th modular polynomial for $λ$-invariants. A simple generalization of Kronecker's classical congruence shows that $R(X):=\frac{F_p(X,X^{p})}{p}$ is in $\mathbf{Z}[X]$. We give a formula for $R(λ)$ if $λ$ is a supersingular. This formula is related to the Manin--Dri…
This is a sequel to the paper [F. Breuer, H.-G. Rück, Drinfeld modular polynomials in higher rank, J. Number Theory 129 (2009), 59-83.], in which we introduced Drinfeld modular polynomials of higher rank, using an analytic construction. These polynomials relate the isomorphism invariants of Drinfeld F_q[T]-modules of rank r\geq 2 linked by isogenies of a specified type. In the current paper, we give an algebraic construction of greater generality, and prove a generalization of the Kronecker congruences relations, which describe what happens when modular polynomials associated to P-isogenies ar…
This article starts a computational study of congruences of modular forms and modular Galois representations modulo prime powers. Algorithms are described that compute the maximum integer modulo which two monic coprime integral polynomials have a root in common in a sense that is defined. These techniques are applied to the study of congruences of modular forms and modular Galois representations modulo prime powers. Finally, some computational results with implications on the (non-)liftability of modular forms modulo prime powers and possible generalisations of level raising are presented.
In this paper, we derive a new computational algorithm for Barrett technique for modular polynomial multiplication, termed BA-P. BA-P is then applied to a new residue arithmetic based Barrett algorithm for modular polynomial multiplication (BA-MPM). The focus of the work is an algorithm that carries out the entire computation using only modular arithmetic without conversion to large degree polynomials. There are several parts to this work. First, we set up a new BA-P using polynomials other than u^alfa. Second, residue arithmetic based BA-MPM is described. A complete mathematical framework is …
In this expository paper, we illustrate two explicit methods which lead to special $L$-values of certain modular forms admitting complex multiplication (CM), motivated in part by properties of $L$-functions obtained from Calabi-Yau manifolds defined over $\mathbb Q$.
We investigate hyperderivatives of Drinfeld modular forms and determine formulas for these derivatives in terms of Goss polynomials for the kernel of the Carlitz exponential. As a consequence we prove that v-adic modular forms in the sense of Serre, as defined by Goss and Vincent, are preserved under hyperdifferentiation. Moreover, upon multiplication by a Carlitz factorial, hyperdifferentiation preserves v-integrality.
Let $\mathcal{E}$ be an elliptic curve over a field $K$ and $\ell$ a prime. There exists an elliptic curve $\mathcal{E}^*$ related to $\mathcal{E}$ by anisogeny (rational map that is also a group homomorphisms) of degree $\ell$ if and only $Φ_\ell(X, j(\mathcal{E})) = 0$, where $Φ_\ell(X, Y)$ is the traditional modular polynomial. Moreover, the modular polynomial gives the coefficients of $\mathcal{E}^*$, together with parameters needed to build the isogeny explicitly. Since the traditional modular polynomial has large coefficients, many families with smaller coefficients can be used instead, …
We compute modular Galois representations associated with a newform $f$, and study the related problem of computing the coefficients of $f$ modulo a small prime $\ell$. To this end, we design a practical variant of the complex approximations method presented in the book edited by B. Edixhoven and J.-M. Couveignes. Its efficiency stems from several new ingredients. For instance, we use fast exponentiation in the modular jacobian instead of analytic continuation, which greatly reduces the need to compute abelian integrals, since most of the computation handles divisors. Also, we introduce an eff…
For each of the groups PSL2(F25), PSL2(F32), PSL2(F49), PGL2(F25), and PGL2(F27), we display the first explicitly known polynomials over Q having that group as Galois group. Each polynomial is related to a Galois representation associated to a modular form. We indicate how computations with modular Galois representations were used to obtain these polynomials. For each polynomial, we also indicate how to use Serre's conjectures to determine the modular form giving rise to the related Galois representation.
In a previous article (a joint work with J. Manoharmayum) the modularity of a large class of rigid Calabi-Yau threefolds was established. To make that result more explicit, we recall (and re-prove) a result of Serre giving a bound for the conductor of an "integral" 2-dimensional compatible family of Galois representations and apply this result to give an algorithm that determines the level of a modular rigid Calabi-Yau threefold. We apply the algorithm to three examples.
We study the differential polynomial rings which are defined using the special geometry of the moduli spaces of Calabi-Yau threefolds. The higher genus topological string amplitudes are expressed as polynomials in the generators of these rings, giving them a global description in the moduli space. At particular loci, the amplitudes yield the generating functions of Gromov-Witten invariants. We show that these rings are isomorphic to the rings of quasi modular forms for threefolds with duality groups for which these are known. For the other cases, they provide generalizations thereof. We furthe…
We study the space of period polynomials associated with modular forms of integral weight for finite index subgroups of the modular group. For the modular group, this space is endowed with a pairing, corresponding to the Petersson inner product on modular forms via a formula of Haberland, and with an action of Hecke operators, defined algebraically by Zagier. We generalize Haberland's formula to (not necessarily cuspidal) modular forms for finite index subgroups, and we show that it conceals two stronger formulas. We extend the action of Hecke operators to period polynomials of modular forms, …
This article analyzes the periodic orbits of Syracuse dynamical systems in a novel algebraic setting: the commutative ring of graded $n$-adic integers. Within this context, this article introduces a dual-radix modular division algorithm for computing the graded canonical expansions and graded quotients for a certain class of rational expressions that arise from periodic orbits within these dynamical systems. This division algorithm yields two novel methods for testing the integrality of the Böhm-Sontacchi numbers.
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions and on interpolation, which has received little attention in the literature, has a complexity that is essentially (up to logarithmic factors) linear in the size of the computed polynomials. In particular, it obtains the classical modular polynomials $Φ_\ell$ of prime level $\ell$ in time O (\ell^3 \log^4 \ell \log \log \ell). Besides treating modular polynomials for $Γ^0 (\ell)$, which are an important ingredient in m…
The relations satisfied by period polynomials associated to modular forms yield a way to count dimensions of spaces of cusp forms. After showing how these relations arise from those on the mapping class group $PSL(2, \mathbb{Z})$ of the moduli space $\mathcal{M}_{0,4}$ of genus 0 curves with 4 marked points, the author goes on to define period polynomials associated to Picard modular forms. Relations on these Picard period polynomials are then determined, and via an embedding of a monodromy representation of the moduli space $\mathcal{M}_{0,5}$ of genus 0 curves with 5 marked points in $PU(2,1…
There have been a number of recent works on the theory of period polynomials and their zeros. In particular, zeros of period polynomials have been shown to satisfy a "Riemann Hypothesis" in both classical settings and for cohomological versions extending the classical setting to the case of higher derivatives of $L$-functions. There thus appears to be a general phenomenon behind these phenomena. In this paper, we explore further generalizations by defining a natural analogue for Hilbert modular forms. We then prove that similar Riemann Hypotheses hold in this situation as well.
Let p and r be two primes and n, m be two distinct divisors of pr. Consider the n-th and m-th cyclotomic polynomials. In this paper, we present lower and upper bounds for the coefficients of the inverse of one of them modulo the other one. We mention an application to torus-based cryptography.
The goal in this preprint is to give an efficient algorithm to compute Puiseux expansions at cusps of X0(N). It is based on a relation with a hypergeometric function that holds for any N.
Motivated by the dynamical uniform boundedness conjecture of Morton and Silverman, specifically in the case of quadratic polynomials, we give a formal construction of a certain class of dynamical analogues of classical modular curves. The preperiodic points for a quadratic polynomial map may be endowed with the structure of a directed graph satisfying certain strict conditions; we call such a graph admissible. Given an admissible graph $G$, we construct a curve $X_1(G)$ whose points parametrize quadratic polynomial maps -- which, up to equivalence, form a one-parameter family -- together with …
We report on a systematic computation of weight one cuspidal eigenforms for the group $Γ_1(N)$ in characteristic zero and in characteristic $p>2$. Perhaps the most surprising result was the existence of a mod 199 weight~1 cusp form of level 82 which does not lift to characteristic zero.
In this paper, we present a probabilistic algorithm to compute the number of $\mathbb{F}_p$-points of modular curve $X_1(n)$. Under the Generalized Riemann Hypothesis(GRH), the algorithm takes $\textrm{O}(n^{56+δ+ε}\log^{9+ε} p)$ bit operations, where $δ$ is an absolute constant and $ε$ is any positive real number. As an application, we can compute $#X_1(17)(\mathbb{F}_p)\textrm{mod} 17$ for huge primes $p$. For example, we have $#X_1(17)(\mathbb{F}_{10^{1000}+1357})\textrm{mod} 17=3$.
For a prime m, let Phi_m be the classical modular polynomial, and let h(Phi_m) denote its logarithmic height. By specializing a theorem of Cohen, we prove that h(Phi_m) <= 6 m log m + 16 m + 14 sqrt m log m. As a corollary, we find that h(Phi_m) <= 6 m log m + 18 m also holds. A table of h(Phi_m) values is provided for m <= 3607.
Among all the dynamical modular curves associated to quadratic polynomial maps, we determine which curves have infinitely many quadratic points. This yields a classification statement on preperiodic points for quadratic polynomials over quadratic fields, extending previous work of Poonen, Faber, and the authors.
We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform several modular operations with machine integer or floating point arithmetic. The modular polynomials are converted into integers using Kronecker substitution (evaluation at a sufficiently large integer). With some control on the sizes and degrees, arithmetic operations on the polynomials can be performed directly with machine integers or floating point numbers and the number of conversions can be reduced. We also present …
We give algorithms for computing the singular moduli of suitable nonholomorphic modular functions F(z). By combining the theory of isogeny volcanoes with a beautiful observation of Masser concerning the nonholomorphic Eisenstein series E_2*(z), we obtain CRT-based algorithms that compute the class polynomials H_D(F;x), whose roots are the discriminant D singular moduli for F(z). By applying these results to a specific weak Maass form F_p(z), we obtain a CRT-based algorithm for computing partition class polynomials, a sequence of polynomials whose traces give the partition numbers p(n). Under t…
