Related papers: Using the Charlap-Coley-Robbins polynomials for co…

We present new conditions which obstruct the existence of hyperelliptic Jacobians in isogeny classes of abelian varieties over finite fields of characteristic 2. We show that Weil polynomials of Jacobians cannot have coefficients in certain…

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…

We analyse the complexity of computing class polynomials, that are an important ingredient for CM constructions of elliptic curves, via complex floating point approximations of their roots. The heart of the algorithm is the evaluation of…

We extend our method to compute division polynomials of Jacobians of curves over Q to curves over Q(t), in view of computing mod ell Galois representations occurring in the \'etale cohomology of surfaces over Q. Although the division…

Let $K$ be a field of characteristic different from $2$ and let $E$ be an elliptic curve over $K$, defined either by an equation of the form $y^{2} = f(x)$ with degree $3$ or as the Jacobian of a curve defined by an equation of the form…

A formalism is given to count integer and rational solutions to polynomial equations with rational coefficients. These polynomials $P(x)$ are parameterized by three integers, labeling an elliptic curve. The counting of the rational…

We present the geometry lying behind counting twin prime polynomials in $\mathbb{F}_q[T]$ in general. We compute cohomology and explicitly count points by means of a twisted Lefschetz trace formula applied to these parametrizing varieties…

In 2005, Kayal suggested that Schoof's algorithm for counting points on elliptic curves over finite fields might yield an approach to factor polynomials over finite fields in deterministic polynomial time. We present an exposition of his…

We propose a randomized algorithm to compute isomorphisms between finite fields using elliptic curves. To compute an isomorphism between two fields of cardinality $q^n$, our algorithm takes $$n^{1+o(1)} \log^{1+o(1)}q + \max_{\ell}…

In a former paper it has been shown that the elliptic Gau{\ss} sums, whose use has been proposed in the context of counting points on elliptic curves and primality tests, can be computed by using modular functions. In this work we give…

Kaneko and Sakai recently observed that certain elliptic curves whose associated newforms (by the modularity theorem) are given by the eta-quotients can be characterized by a particular differential equation involving modular forms and…

In this paper we give a module-theoretic description of the isomorphism classes of abelian varieties $A$ isogenous to $B^r$, where the characteristic polynomial $g$ of Frobenius of $B$ is an ordinary square-free $q$-Weil polynomial, for a…

We find a new class of algebraic geometric solutions of Heun's equation with the accessory parameter belonging to a hyperelliptic curve. Dependence of these solutions from the accessory parameter as well as their relation to Heun's…

We describe deterministic and probabilistic algorithms to determine whether or not a given monic irreducible polynomial H in Z[X] is a Hilbert class polynomial, and if so, which one. These algorithms can be used to determine whether a given…

Let $\mathsf{E}/\mathbb{Q}$ be an elliptic curve. By the modularity theorem, it admits a surjection from a modular curve $X_0(N) \to \mathsf{E}$, and the minimal degree among such maps is called the modular degree of $\mathsf{E}$. By the…

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 show how the size of the Galois groups of iterates of a quadratic polynomial $f(x)$ can be parametrized by certain rational points on the curves $C_n:y^2=f^n(x)$ and their quadratic twists. To that end, we study the arithmetic of such…

We construct plane models of the modular curve $X_H(\ell)$, and use their explicit equations to compute Galois representations associated to modular forms for values of $\ell$ that are significantly higher than in prior works.

We construct certain elements in the integral motivic cohomology group $H^3_{{\cal M}}(E \times E',\Q(2))_{\ZZ}$, where $E$ and $E'$ are elliptic curves over $\Q$. When $E$ is not isogenous to $E'$ these elements are analogous to…

Character polynomials are used to study the restriction of a polynomial representation of a general linear group to its subgroup of permutation matrices. A simple formula is obtained for computing inner products of class functions given by…