Related papers: Counting points on superelliptic curves in average…
Let E be an elliptic curve having complex multiplication by a given quadratic order of an imaginary quadratic field K. The field of definition of E is the ring class field Omega of the order. If the prime p splits completely in Omega, then…
We construct a polynomial-time algorithm that given a graph $X$ with $4p$ vertices ($p$ is prime), finds (if any) a Cayley representation of $X$ over the group $C_2\times C_2\times C_p$. This result, together with the known similar result…
We complete the computation of all $\mathbb{Q}$-rational points on all the $64$ maximal Atkin-Lehner quotients $X_0(N)^*$ such that the quotient is hyperelliptic. To achieve this, we use a combination of various methods, namely the…
Division polynomials associated to an elliptic curve $E/K$ are polynomials $\phi_n, \psi_n^2$ that arise from the sequence of points $\{nP\}_{n \in \mathbb{N}}$ on this curve. If one wishes to study $\mathbb{Z}$--linear combination of…
In these short notes, we will show the following. Let F_q be a finite field and let E/\F_q be an elliptic curve. Let S_r be the rth summation/Semaev polynomial for E. Under an assumption, we show that it is NP-complete to check if S_r…
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…
In this paper we study quadratic points on the non-split Cartan modular curves $X_{ns}(p)$, for $p = 7, 11,$ and $13$. Recently, Siksek proved that all quadratic points on $X_{ns}(7)$ arise as pullbacks of rational points on $X_{ns}^+(7)$.…
We give new bounds for the number of integral points on elliptic curves. The method may be said to interpolate between approaches via diophantine techniques ([BP], [HBR]) and methods based on quasiorthogonality in the Mordell-Weil lattice…
We develop geometry-of-numbers methods to count orbits in coregular vector spaces having bounded invariants over any global field. We apply these techniques to bound the average ranks and determine average Selmer group sizes of elliptic…
We develop an efficient quantum implementation of an important signal processing algorithm for line spectral estimation: the matrix pencil method, which determines the frequencies and damping factors of signals consisting of finite sums of…
Solving linear systems of equations is a common problem that arises both on its own and as a subroutine in more complex problems: given a matrix A and a vector b, find a vector x such that Ax=b. We consider the case where one doesn't need…
Let $S\subset R^n$ be a compact basic semi-algebraic set defined as the real solution set of multivariate polynomial inequalities with rational coefficients. We design an algorithm which takes as input a polynomial system defining $S$ and…
We consider the problem of computing sample points in each connected component of a semi-algebraic set defined by the non-vanishing or the positivity of an n-variate polynomial of degree d, with rational coefficients of bit size bounded by…
We prove that, when elliptic curves $E/\mathbb{Q}$ are ordered by height, the average number of integral points $\#|E(\mathbb{Z})|$ is bounded, and in fact is less than $66$ (and at most $\frac{8}{9}$ on the minimalist conjecture). By…
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…
The fast computation of large kernel sums is a challenging task, which arises as a subproblem in any kernel method. We approach the problem by slicing, which relies on random projections to one-dimensional subspaces and fast Fourier…
We describe a deterministic algorithm that computes an approximate root of n complex polynomial equations in n unknowns in average polynomial time with respect to the size of the input, in the Blum-Shub-Smale model with square root. It…
Given an integer $q$ and a polynomial $f\in \mathbb Z_{q}[X]$ of degree $d$ with coefficients in the residue ring $\mathbb Z_q=\mathbb Z/q\mathbb Z,$ we obtain new results concerning the number of solutions to congruences of the form…
We develop a meta-algorithm that, given a polynomial (in one or more variables), and a prime p, produces a fast (logarithmic time) algorithm that takes a positive integer n and outputs the number of times each residue class modulo p appears…
The Chabauty--Coleman--Kim method, under favourable circumstances, describes the set of integral points of a hyperelliptic curve inside the $p$-adic zeroes of certain transcendental functions. For an elliptic curve of Mordell--Weil rank…