English
Related papers

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

200 papers

In this paper we improve on existing methods to compute quadratic points on modular curves and apply them to successfully find all the quadratic points on all modular curves $X_0(N)$ of genus up to $8$, and genus up to $10$ with $N$ prime,…

Number Theory · Mathematics 2023-10-03 Nikola Adžaga , Timo Keller , Philippe Michaud-Jacobs , Filip Najman , Ekin Ozman , Borna Vukorepa

In this paper we shall investigate the problem of the representation of the number of integral points of an elliptic curve modulo a prime number p. We present a way of expressing an exponential sum which involves polynomials of third…

Number Theory · Mathematics 2013-03-11 Michael Th. Rassias

Let $k,p\in \mathbb{N}$ with $p$ prime and let $f\in\mathbb{Z}[x_1,x_2]$ be a bivariate polynomial with degree $d$ and all coefficients of absolute value at most $p^k$. Suppose also that $f$ is variable separated, i.e., $f=g_1+g_2$ for…

Number Theory · Mathematics 2021-02-03 Caleb Robelle , J. Maurice Rojas , Yuyu Zhu

We present a Mordell-Weil sieve that can be used to compute points on certain bielliptic modular curves $X_0(N)$ over fixed quadratic fields. We study $X_0(N)(\mathbb{Q}(\sqrt{d}))$ for $N \in \{ 53,61,65,79,83,89,101,131 \}$ and $\lvert d…

Number Theory · Mathematics 2023-04-21 Philippe Michaud-Jacobs

Given an elliptic curve E/Q and a prime p at which E has good reduction, let e_p be the exponent of the group E_p(F_p) of F_p-rational points on the reduction of E modulo p. Under the Generalized Riemann Hypothesis (GRH) for the Dedekind…

Number Theory · Mathematics 2012-12-11 Tristan Freiberg , Pär Kurlberg

A fundamental problem in arithmetic geometry is to determine the image of the mod $N$ Galois representation for all elliptic curves over $\mathbb{Q}$ and integers $N \geq 1$. For a given subgroup $G \le…

Number Theory · Mathematics 2026-05-26 Jacob Mayle , Jeremy Rouse

We determine all the quadratic points on the genus $13$ modular curve $X_0(163)$, thus completing the answer to a recent question of Banwait, the second-named author, and Padurariu. In doing so, we investigate a curious phenomenon involving…

Number Theory · Mathematics 2023-10-17 Philippe Michaud-Jacobs , Filip Najman

We prove an arithmetic Riemann-Roch theorem for pointed stable curves. We derive consequences for the Selberg zeta function of an open modular curve $Y_{1}(p)$ (resp. $Y_{0}(p)$), for a prime number $p\geq 11$ (resp. congruent to 11 modulo…

Number Theory · Mathematics 2008-01-14 Gerard Freixas I. Montplet

Let $X$ be a smooth projective curve over a finite field of characteristic $p$. We describe and implement a practical algorithm for computing the $p$-divisible group $Jac(X)[p^\infty]$ via computing its Dieudonn\'{e} module, or equivalently…

Number Theory · Mathematics 2026-01-21 Jeremy Booher

For a prime $p$ and an absolutely irreducible modulo $p$ polynomial $f(U,V) \in \Z[U,V]$ we obtain an asymptotic formulas for the number of solutions to the congruence $f(x,y) \equiv a \pmod p$ in positive integers $x \le X$, $y \le Y$,…

Number Theory · Mathematics 2007-05-23 I. E. Shparlinski , J. F. Voloch

This is a survey on recent results on counting of curves over finite fields. It reviews various results on the maximum number of points on a curve of genus g over a finite field of cardinality q, but the main emphasis is on results on the…

Algebraic Geometry · Mathematics 2014-09-23 Gerard van der Geer

We determine the quadratic points on the modular curves $X_0(N)$ for $N\leq 100$ for which this has not been previously done, namely the cases $$N\in\{66,70,78,82,84,86,87,88,90,96,99\}.$$ We accomplish this by improving on the ``going down…

Number Theory · Mathematics 2025-08-21 Filip Najman , Ivan Novak

Let $E$ be an elliptic curve defined over ${\mathbb Q}$. For a prime $p$ of good reduction for $E$, denote by $e_p$ the exponent of the reduction of $E$ modulo $p$. Under GRH, we prove that there is a constant $C_E\in (0, 1)$ such that $$…

Number Theory · Mathematics 2012-06-27 Jie Wu

Modular curves like X_0(N) and X_1(N) appear very frequently in arithmetic geometry. While their complex points are obtained as a quotient of the upper half plane by some subgroups of SL_2(Z), they allow for a more arithmetic description as…

Number Theory · Mathematics 2017-03-24 Marusia Rebolledo , Christian Wuthrich

Let a polytope $P$ be defined by a system $A x \leq b$. We consider the problem of counting the number of integer points inside $P$, assuming that $P$ is $\Delta$-modular, where the polytope $P$ is called $\Delta$-modular if all the rank…

Computational Complexity · Computer Science 2023-05-09 D. V. Gribanov , D. S. Malyshev

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…

Number Theory · Mathematics 2024-10-10 Maarten Derickx , Petar Orlić

In this work, we consider the rational points on elliptic curves over finite fields F_{p}. We give results concerning the number of points on the elliptic curve y^2{\equiv}x^3+a^3(mod p)where p is a prime congruent to 1 modulo 6. Also some…

Number Theory · Mathematics 2011-06-28 Musa Demirci , Gokhan Soydan , Ismail Naci Cangul

Let $p$ be a prime. We study non-constant morphisms $f:X_0(p)_\mathbb \to Y$, where $Y/\mathbb Q$ is a curve of genus $\geq 2$. We prove that for $p<3000$ such an $f$ of degree $d>1$ must be isomorphic to the quotient map $X_0(p)\to…

Algebraic Geometry · Mathematics 2026-02-12 Maarten Derickx , Petar Orlić

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…

Number Theory · Mathematics 2009-05-08 Andreas Enge

We study the Generalized Fermat Equation $x^2 + y^3 = z^p$, to be solved in coprime integers, where $p \ge 7$ is prime. Using modularity and level lowering techniques, the problem can be reduced to the determination of the sets of rational…

Number Theory · Mathematics 2019-06-17 Nuno Freitas , Bartosz Naskrecki , Michael Stoll