Related papers: Counting points on abelian surfaces over finite fi…
We classify smooth projective surfaces that are quotients of abelian surfaces by finite groups.
We show that for an elliptic curve E defined over a number field K, the group E(A) of points of E over the adele ring A of K is a topological group that can be analyzed in terms of the Galois representation associated to the torsion points…
We introduce a new iterative method for computing solutions of elliptic equations with random rapidly oscillating coefficients. Similarly to a multigrid method, each step of the iteration involves different computations meant to address…
We use a global version of Heath-Brown's $p-$adic determinant method developed by Salberger to give upper bounds for the number of rational points of height at most $B$ on non-singular cubic curves defined over $\mathbb{Q}$. The bounds are…
We prove useful necessary and sufficient conditions for an elliptic curve over a number field to admit a surjective adelic Galois representation. Using these conditions, we compute an example of a number field K and an elliptic curve E/K…
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 present normal forms for elliptic curves over a field of characteristic $2$ analogous to Edwards normal form, and determine bases of addition laws, which provide strikingly simple expressions for the group law. We deduce efficient…
Let $E_1, \ldots, E_s $ be $s$, not necessary distinct, elliptic curves over $\mathbb{Q}$. We give upper bounds on the frequency of $s$-tuples of points in $E_1(\mathbb{Q})\times \ldots \times E_s(\mathbb{Q})$ whose denominators or…
Let A be an abelian variety defined over a number field F. For a prime number $\ell$, we consider the field extension of F generated by the $\ell$-powered torsion points of A. According to a conjecture made by Rasmussen and Tamagawa, if we…
Elliptic curves over finite fields with predefined conditions in the order are practically constructed using the theory of complex multiplication. The stage with longest calculations in this method reconstructs some polynomial with integer…
We study twisted ideal sheaves of small length on an irreducible principally polarized abelian surface (T,l). Using Fourier-Mukai techniques we associate certain jumping schemes to such sheaves and completely classify such loci. We give…
I provide methods of constructing elliptic and hyperelliptic curves over global fields with interesting rational points over the given fields or over large field extensions. I also provide a elliptic curves defined over any given number…
For any number field $K$ and integer $0\leq r \leq 4$, we prove that there are infinitely many elliptic curves over $K$ of rank $r$. Our elliptic curves are obtained by specializing well-chosen nonisotrivial elliptic curves over the…
We present an algorithm which speeds scalar multiplication on a general elliptic curve by an estimated 3.8 % to 8.5 % over the best known general methods when using affine coordinates. This is achieved by eliminating a field multiplication…
Currently, the best upper bounds on the number of rational points on an absolutely irreducible, smooth, projective algebraic curve of genus g defined over a finite field F_q come either from Serre's refinement of the Weil bound if the genus…
We develop efficient and high-order accurate finite difference methods for elliptic partial differential equations in complex geometry in the Difference Potentials framework. The main novelty of the developed schemes is the use of local…
Let $E/\bbq$ be an elliptic curve defined over $\bbq$ with conductor $N$ and $\gq$ the absolute Galois group of an algebraic closure $\bar{\bbq}$ of $\bbq$. We prove that for every $\sigma\in \gq$, the Mordell-Weil group $E(\oqs)$ of $E$…
This paper is the third installment in a series of papers devoted to the computation of enumerative invariants of abelian surfaces through the tropical approach. We develop a pearl diagram algorithm similar to the floor diagram algorithm…
Though it is well known that the roots of any affine polynomial over a finite field can be computed by a system of linear equations by using a normal base of the field, such solving approach appears to be difficult to apply when the field…
Kedlaya's algorithm (Kedlaya, J. Ramanujan Math. Soc 16, 2001) can be used to count the points of arbitrary hyperelliptic curves over finite fields of characteristic p, where p is an odd prime. The algorithm uses the cohomology of a p-adic…