Related papers: Computing points on modular curves over finite fie…

We present a very efficient algorithm to construct an elliptic curve E and a finite field F such that the order of the point group E(F) is a given prime number N. Heuristically, this algorithm only takes polynomial time Otilde((\log N)^3),…

For small odd primes $p$, we prove that most of the rational points on the modular curve $X_0(p)/w_p$ parametrize pairs of elliptic curves having infinitely many supersingular primes. This result extends the class of elliptic curves for…

In this study, we determine all modular curves $X_0(N)$ that admit infinitely many cubic points.

Let $X$ be a scheme of finite type over $\mathbf{Z}$. For $p \in \mathcal{P}$ the set of prime numbers, let $N_{X}(p)$ be the number of $\mathbf{F}_{p}$-points of $X/\mathbf{F}_{p}$. For fixed $n\geq 1$ and $a_{1}, \ldots, a_{n} \in…

Let $X_\Delta(N)$ be an intermediate modular curve of level $N$, meaning that there exist (possibly trivial) morphisms $X_1(N)\rightarrow X_\Delta(N) \rightarrow X_0(N)$. For all such intermediate modular curves, we give an explicit…

Given an elliptic curve $E$ and a positive integer $N$, we consider the problem of counting the number of primes $p$ for which the reduction of $E$ modulo $p$ possesses exactly $N$ points over $\mathbb F_p$. On average (over a family of…

We produce a collection of families of curves, whose point count statistics over F_p becomes Gaussian for p fixed. In particular, the average number of F_p points on curves in these families tends to infinity.

We completely determine the $1085$ open subgroups $H$ of $\operatorname{GL}_2(\widehat{\mathbb{Z}})$ of prime-power level that satisfy $-I \in H$ and $\operatorname{det}(H)=\widehat{\mathbb{Z}}^{\times}$ for which the corresponding modular…

For a complex elliptic curve $E$ and a point $p$ of order $n$ on it, the images of the points $p_k=kp$ under the Weierstrass embedding of $E$ into $\mathbb{C}\mathbb{P}^2$ are collinear if and only if the sum of indices is divisible by $n$.…

We describe an algorithm to count the number of rational points of an hyperelliptic curve defined over a finite field of odd characteristic which is based upon the computation of the action of the Frobenius morphism on a basis of the…

We present a method for constructing optimized equations for the modular curve X_1(N) using a local search algorithm on a suitably defined graph of birationally equivalent plane curves. We then apply these equations over a finite field F_q…

We show that the existence of a non-trivial solution of $x^n+y^n=p^n$, with $p$ a prime number, is equivalent to the existence of a solution of a certain (over-determined) system of $(n-1)$-recursion relations ("zipper" equations) in…

By the Gottesman-Knill Theorem, the outcome probabilities of Clifford circuits can be computed efficiently. We present an alternative proof of this result for quopit Clifford circuits (i.e., Clifford circuits on collections of $p$-level…

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…

This paper presents algorithmic approaches to study superspecial hyperelliptic curves. The algorithms proposed in this paper are: an algorithm to enumerate superspecial hyperelliptic curves of genus $g$ over finite fields $\mathbb{F}_q$,…

We give a classification of the degrees of the points with rational $j$-invariant on the modular curves $X_{0}(n)$ and $X_{1}(n)$. The degrees which occur infinitely often are computed unconditionally, while those which occur finitely often…

It is shown that, under some mild technical conditions, representations of prime numbers by binary quadratic forms can be computed in polynomial complexity by exploiting Schoof's algorithm, which counts the number of $\mathbb F_q$-points of…

Consider a modular curve $X_G$ defined over a number field $K$, where $G$ is a subgroup of $GL_2(\mathbb{Z}/N\mathbb{Z})$ with $N>2$. The curve $X_G$ comes with a morphism $j: X_G\to \mathbb{P}^1_K=\mathbb{A}^1_K \cup\{\infty\}$ to the…

We implement an algorithm to compute the number of points over finite fields for the Shimura curves $X_0^D(N)$ and their Atkin--Lehner quotients. Our computations result in many examples of curves which attain the largest known point counts…

For any prime $p>3$ and rational $p$-integers $b,c$ with $c(b^3-27c)\not\equiv 0\pmod p$ let $V_p(x^2+bx+\frac cx)$ be the residue-counts of $x^2+bx+\frac cx$ modulo $p$ as $x$ runs over $1,2,\ldots,p-1$. In this paper, we reveal the…