Related papers: Encoding points on hyperelliptic curves over finit…
We classify the possible torsion structures of rational elliptic curves over sextic number fields.
This note provides new closed forms evaluations of a few classes of exponential sums associated with elliptic curves and hyperelliptic curves.
Let $n$ be an integer such that the modular curve $X_0(n)$ is hyperelliptic of genus $\ge2$ and such that the Jacobian of $X_0(n)$ has rank $0$ over $\mathbb Q$. We determine all points of $X_0(n)$ defined over quadratic fields, and we give…
We show that one can enumerate the vertices of the convex hull of integer points in polytopes whose constraint matrices have bounded and nonzero subdeterminants, in time polynomial in the dimension and encoding size of the polytope. This…
We describe an algorithm for counting points on an arbitrary hyperelliptic curve over a finite field of odd characteristic, using Monsky-Washnitzer cohomology to compute a p-adic approximation to the characteristic polynomial of Frobenius.…
Consider a pair of ordinary elliptic curves $E$ and $E'$ defined over the same finite field $\mathbb{F}_q$. Suppose they have the same number of $\mathbb{F}_q$-rational points, i.e. $|E(\mathbb{F}_q)|=|E'(\mathbb{F}_q)|$. In this paper we…
For a variety of finite groups $\mathbf H$, let $\overline{\mathbf H}$ denote the variety of finite semigroups all of whose subgroups lie in $\mathbf H$. We give a characterization of the subsets of a finite semigroup that are pointlike…
Let $C$ be a hyperelliptic curve over $\mathbb Q$ described by $y^2=a_0x^n+a_1x^{n-1}+\ldots+a_n$, $a_i\in\mathbb Q$. The points $P_{i}=(x_{i},y_{i})\in C(\mathbb{Q})$, $i=1,2,...,k,$ are said to be in a geometric progression of length $k$…
We present an algorithm for computing curves and families of curves of prescribed degree and geometric genus on real rational surfaces.
Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we develop general theorems on permutation polynomials over finite fields. As a…
We study the de Rham fundamental group of the configuration space $E^{(n)}$ of $n+1$ marked points on an elliptic curve $E$, and define multiple elliptic polylogarithms. These are multivalued functions on $E^{(n)}$ with unipotent monodromy,…
A smooth curve in the real projective plane is hyperbolic if its ovals are maximally nested. By the Helton-Vinnikov Theorem, any such curve admits a definite symmetric determinantal representation. We use polynomial homotopy continuation to…
For every elliptic curve $E$ which has complex multiplication (CM) and is defined over a number field $F$ containing the CM field $K$, we prove that the family of $p^{\infty}$-division fields of $E$, with $p \in \mathbb{N}$ prime, becomes…
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…
In the first part of this article, we consider ruled surfaces defined over a finite field; we introduce invariants for them, and describe some explicit contructions that illustrate possible behaviour of these invariants. In the second part,…
We classify completely the intersections of the Hermitian curve with parabolas in the affine plane. To obtain our results we employ well-known algebraic methods for finite fields and geometric properties of the curve automorphisms. In…
We give a explicit computation of the pointed harmonic volumes of hyperelliptic curves with Weierstrass base points, which are paraphrased into a combinatorial formula.
We propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speedup of the decoding process of Bose-Chaudhuri-Hocquenghem, Reed-Solomon, and some other error-correcting codes.
We give a short proof of polynomial recurrence with large intersection for additive actions of finite-dimensional vector spaces over countable fields on probability spaces, improving upon the known size and structure of the set of strong…
We derive an efficient algorithm to find solutions to Euler's concordant form problem and rational points on elliptic curves associated with this problem.