Related papers: Fast Computation of Isomorphisms Between Finite Fi…

In this paper, we establish the modularity of every elliptic curve $E/F$, where $F$ runs over infinitely many imaginary quadratic fields, including $\mathbb{Q}(\sqrt{-d})$ for $d=1,2,3,5$. More precisely, let $F$ be imaginary quadratic and…

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 complexity of the following numerical problem is studied in the quantum model of computation: Consider a general elliptic partial differential equation of order 2m in a smooth, bounded domain Q\subset \R^d with smooth coefficients and…

Given two convex polygons $P$ and $Q$ with $n$ and $m$ edges, the maximum overlap problem is to find a translation of $P$ that maximizes the area of its intersection with $Q$. We give the first randomized algorithm for this problem with…

The Max-Cut problem is known to be NP-hard on general graphs, while it can be solved in polynomial time on planar graphs. In this paper, we present a fixed-parameter tractable algorithm for the problem on `almost' planar graphs: Given an…

Let $E$ be an elliptic curve over the finite field $\mathbb F_q$. We prove that, when $n$ is a sufficiently large positive integer, $\#E(\mathbb F_{q^n})$ has a prime factor exceeding $n\exp(c\log n/\log\log n)$.

Deciding whether or not two polynomials have isomoprhic splitting fields over the rationals is the Field Isomorphism Problem. We consider polynomials of the form $f_n(x) = x^4-nx^3-6x^2+nx+1$ with $n \neq 3$ a positive integer and we let…

Graphs with high symmetry or regularity are the main source for experimentally hard instances of the notoriously difficult graph isomorphism problem. In this paper, we study the computational complexity of isomorphism testing for line…

Random graph matching refers to recovering the underlying vertex correspondence between two random graphs with correlated edges; a prominent example is when the two random graphs are given by Erd\H{o}s-R\'{e}nyi graphs $G(n,\frac{d}{n})$.…

We combine the parameterization method for invariant manifolds with the finite element method for elliptic PDEs,to obtain a new computational framework for high order approximation of invariant manifolds attached to unstable equilibrium…

We give an algorithm for computing an inseparable endomorphism of a supersingular elliptic curve $E$ defined over $\mathbb F_{p^2}$, which, conditional on GRH, runs in expected $O(p^{1/2}(\log p)^2(\log\log p)^3)$ bit operations and…

We consider the problem of developing automated techniques for solving recurrence relations to aid the expected-runtime analysis of programs. Several classical textbook algorithms have quite efficient expected-runtime complexity, whereas…

Let $\mathbb{Q}(\alpha)$ and $\mathbb{Q}(\beta)$ be algebraic number fields. We describe a new method to find (if they exist) all isomorphisms, $\mathbb{Q}(\beta) \rightarrow \mathbb{Q}(\alpha)$. The algorithm is particularly efficient if…

We construct a new quantum algorithm for the graph collision problem; that is, the problem of deciding whether the set of marked vertices contains a pair of adjacent vertices in a known graph G. The query complexity of our algorithm is…

We prove the $p$-parity conjecture for elliptic curves over global fields of characteristic $p > 3$. We also present partial results on the $\ell$-parity conjecture for primes $\ell \neq p$.

We present a new approach to handling the case of Atkin primes in Schoof's algorithm for counting points on elliptic curves over finite fields. Our approach is based on the theory of polynomially cyclic algebras, which we recall as far as…

We show that there are infinitely many elliptic curves $E/\mathbb{Q}$, up to isomorphism over $\overline{\mathbb{Q}}$, for which the finitely generated group $E(\mathbb{Q})$ has rank exactly $2$. Our elliptic curves are given by explicit…

The elliptic curve y^2= x^3-Nx where N=m^4+n^4 has rank at least 2 over Q(m,n). When N can be written in two different ways as sum of two fourth powers, then we prove that the rank is at least 4.

We develop an explicit geometric construction of automorphisms of finite fields arising from isogeny cycles. Let $k$ be a finite field, $E/k$ an elliptic curve, and $\ell$ an integer coprime to $\mathrm{char}(k)$. Let $\mathfrak{h}$ be an…

We construct isotrivial and non-isotrivial elliptic curves over $\mathbb{F}_q(t)$ with an arbitrarily large set of separable integral points. As an application of this construction, we prove that there are isotrivial log-general type…