Related papers: N-systems, class polynomials for double eta-quotie…
The classical modular polynomial for $j$-invariants describes the relation between two elliptic curves connected by isogenies. This polynomial has been applied to various algorithms in computational number theory, such as point counting on…
The classical modular equations involve bivariate polynomials that can be seen to be univariate with coefficients in the modular invariant $j$. Kiepert found modular equations relating some $\eta$-quotients and the Weber functions…
We present two algorithms that, given a prime ell and an elliptic curve E/Fq, directly compute the polynomial Phi_ell(j(E),Y) in Fq[Y] whose roots are the j-invariants of the elliptic curves that are ell-isogenous to E. We do not assume…
We investigate modularity of elliptic curves over a general totally real number field, establishing a finiteness result for the set non-modular $j$-invariants. By analyzing quadratic points on some modular curves, we show that all elliptic…
Elliptic curves over finite fields with predefined conditions in the order are practically constructed using the theory of complex multiplication. The stage with longest calculations in this method reconstructs some polynomial with integer…
Let F be a finite field and let b and N be integers. We prove explicit estimates for the probability that the number of rational points on a randomly chosen elliptic curve E over F equals b modulo N. The underlying tool is an…
Kaneko and Sakai recently observed that certain elliptic curves whose associated newforms (by the modularity theorem) are given by the eta-quotients can be characterized by a particular differential equation involving modular forms and…
It is known that all modular forms on SL_2(Z) can be expressed as a rational function in eta(z), eta(2z) and eta(4z). By utilizing known theorems, and calculating the order of vanishing, we can compute the eta-quotients for a given level.…
It is known that all modular forms on $SL_2(Z)$ can be expressed as a rational function in $\eta(z)$, $\eta(2z)$ and $\eta(4z)$. By using a theorem by Gordon, Hughes, and Newman, and calculating the order of vanishing, we can compute the…
A formalism is given to count integer and rational solutions to polynomial equations with rational coefficients. These polynomials $P(x)$ are parameterized by three integers, labeling an elliptic curve. The counting of the rational…
The SEA algorithm for computing the cardinality of elliptic curves over finite fields in many characteristic uses modular polynomials. These polynomials come into different flavors, and methods to compute them flourished. Once equipped with…
We describe deterministic and probabilistic algorithms to determine whether or not a given monic irreducible polynomial H in Z[X] is a Hilbert class polynomial, and if so, which one. These algorithms can be used to determine whether a given…
For a given elliptic curve $E$ over a finite local ring, we denote by $E^{\infty}$ its subgroup at infinity. Every point $P \in E^{\infty}$ can be described solely in terms of its $x$-coordinate $P_x$, which can be therefore used to…
The arithmetic of elliptic curves, namely polynomial addition and scalar multiplication, can be described in terms of global sections of line bundles on $E\times E$ and $E$, respectively, with respect to a given projective embedding of $E$…
In this article, we study how to compute the number of $K$-rational points with a given $j$-invariant on an arbitrary modular curve. As an application, for each positive integer $n$, we determine the list of possible numbers of cyclic…
We determine all modular curves $X_0(N)$ with infinitely many quartic points. To do this, we define a pairing that induces a quadratic form representing all possible degrees of a rational morphism from $X_0(N)$ to a positive rank elliptic…
We give an explicit formula for dimensions of spaces of rational-weight modular forms whose multiplier systems are induced by eta-quotients of fractional exponents. As the first application, we give series expressions of Fourier…
Elliptic curves with a known number of points over a given prime field with n elements are often needed for use in cryptography. In the context of primality proving, Atkin and Morain suggested the use of the theory of complex multiplication…
We provide new explicit formulas for bounding the number of rational points on singular curves over finite fields. This enables us to obtain exact values of N q (g, $\pi$) which is defined as the maximum number of rational points over F q…
Let \( E \) be a complex elliptic curve with conductor \( N \) and modular invariant \( j(E) \in \mathbb{Q} \). We construct a class of modular polynomials $F_N(x,j)$ that relate the modular function $x$ on $X_0(N)$ to the $j$-invariant…