English
Related papers

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

200 papers

We compute the Brauer group of the moduli stack of elliptic curves over the integers, localizations of the integers, finite fields of odd characteristic, and algebraically closed fields of characteristic not $2$. The methods involved…

Algebraic Geometry · Mathematics 2020-10-21 Benjamin Antieau , Lennart Meier

Given a prime $p$, an elliptic curve $\E/\F_p$ over the finite field $\F_p$ of $p$ elements and a binary \lrs\ $\(u(n)\)_{n =1}^\infty$ of order~$r$, we study the distribution of the sequence of points $$ \sum_{j=0}^{r-1} u(n+j)P_j, \qquad…

Number Theory · Mathematics 2011-02-08 Simon R. Blackburn , Alina Ostafe , Igor E. Shparlinski

Let X be a (possibly nodal) K-trivial threefold moving in a fixed ambient space P. Suppose X contains a continuous family of curves, all of whose members satisfy certain unobstructedness conditions in P. A formula is given for computing the…

Algebraic Geometry · Mathematics 2007-05-23 Herbert Clemens , Holger P. Kley

We develop an algorithm to test whether a non-CM elliptic curve $E/\mathbb{Q}$ gives rise to an isolated point of any degree on any modular curve of the form $X_1(N)$. This builds on prior work of Zywina which gives a method for computing…

For a superelliptic curve $\mathcal X$, defined over $\mathbb Q$, let $\mathfrak p$ denote the corresponding moduli point in the weighted moduli space. We describe a method how to determine a minimal integral model of $\mathcal X$ such…

Number Theory · Mathematics 2026-01-13 Tanush Shaska

We give regular models for modular curves associated with (normalizer of) split and non-split Cartan subgroups of ${\mathrm{GL}}_2 ({\mathbb F}_p )$ (for $p$ any prime, $p\ge 5$). We then compute the group of connected components of the…

Number Theory · Mathematics 2024-07-30 Bas Edixhoven , Pierre Parent

We describe how the quadratic Chabauty method may be applied to explicitly determine the set of rational points on modular curves of genus $g>1$ whose Jacobians have Mordell--Weil rank $g$. This extends our previous work on the split Cartan…

Number Theory · Mathematics 2023-03-08 Jennifer S. Balakrishnan , Netan Dogra , Jan Steffen Müller , Jan Tuitman , Jan Vonk

For finitely generated subgroups $W_1, \ldots , W_t$ of $\mathbb{Q}^{\times}$, integers $k_1, \ldots , k_t$, a Galois extension $F$ of $\mathbb{Q}$ and a union of conjugacy classes $C \subset \text{Gal}(F/\mathbb{Q})$, we develop methods…

Number Theory · Mathematics 2020-06-15 Olli Järviniemi

We present an algorithm for computing $F_p$, the $p$th moment of an $n$-dimensional frequency vector of a data stream, for $2 < p < \log (n) $, to within $1\pm \epsilon$ factors, $\epsilon \in [n^{-1/p},1]$ with high constant probability.…

Data Structures and Algorithms · Computer Science 2015-03-19 Sumit Ganguly

We give the complete list of possible torsion subgroups of elliptic curves with complex multiplication over number fields of degree 1-13. Additionally we describe the algorithm used to compute these torsion subgroups and its implementation.

Number Theory · Mathematics 2019-02-20 Pete L. Clark , Patrick Corn , Alex Rice , James Stankewicz

Modular algorithm are widely used in computer algebra systems (CAS), for example to compute efficiently the gcd of multivariate polynomials. It is known to work to compute Groebner basis over $\Q$, but it does not seem to be popular among…

Symbolic Computation · Computer Science 2013-11-19 Bernard Parisse

Consider an elliptic curve $E$ over a number field $K$. Suppose that $E$ has supersingular reduction at some prime $\mathfrak{p}$ of $K$ lying above the rational prime $p$. We completely classify the valuations of the $p^n$-torsion points…

Number Theory · Mathematics 2021-10-19 Hanson Smith

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.

Number Theory · Mathematics 2013-07-08 Mark van Hoeij

A method of constructing specific polynomial representations $f(x)$ over the finite field $\mathbb{F}_p$ of the square roots function modulo a prime $p = 2^kn + 1$, $n$ odd, is presented. The formulas for the cases $k = 2$, $3$ and $4$ are…

Number Theory · Mathematics 2023-12-19 N. A. Carella

Given an integer $\gamma\geq 2$ and an odd prime power $q$ we show that for every large genus $g$ there exists a non-singular curve $C$ defined over $\mathbb{F}_q$ of genus $g$ and gonality $\gamma$ and with exactly $\gamma(q+1)$…

Number Theory · Mathematics 2022-03-18 Floris Vermeulen

This article gives an introduction for mathematicians interested in numerical computations in algebraic geometry and number theory to some recent progress in algorithmic number theory, emphasising the key role of approximate computations…

Number Theory · Mathematics 2012-05-29 Jean-Marc Couveignes , Bas Edixhoven

We give an explicit description of the stable reduction of superelliptic curves of the form $y^n=f(x)$ at primes $\p$ whose residue characteristic is prime to the exponent $n$. We then use this description to compute the local $L$-factor of…

Number Theory · Mathematics 2014-09-12 Irene I. Bouw , Stefan Wewers

We provide a formula for the number of $\mathbb{F}_{p}$-points on the Dwork hypersurface $$x_1^n + x_2^n \dots + x_n^n - n \lambda \, x_1 x_2 \dots x_n=0$$ in terms of a $p$-adic hypergeometric function previously defined by the author.…

Number Theory · Mathematics 2016-08-23 Dermot McCarthy

For a square-free integer $N$, we present a procedure to compute $\mathbb{Q}$-curves parametrized by rational points of the modular curve $X_0^*(N)$ when this is hyperelliptic.

Number Theory · Mathematics 2019-10-24 Francesc Bars , Josep González , Xavier Xarles

Recently, Ko\c{c} proposed a neat and efficient algorithm for computing \[ x = a^{-1} \pmod {p^k} \] for a prime $p$ based on the exact solution of linear equations using $p$-adic expansions. The algorithm requires only addition and right…

Data Structures and Algorithms · Computer Science 2026-03-13 Guangwu Xu , Yunxiao Tian , Bingxin Yang