The number A(q) is the upper limit of the ratio of the maximum number of points of a curve defined over $\Fq$ to the genus. By constructing class field towers with good parameters we present improvements of lower bounds of A(q) for q an odd power of a prime.
We describe a method that allows, under some hypotheses, to compute all the rational points of some genus 5 curves defined over a number field. This method is used to solve some arithmetic problems that remained open.
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 classical Chabauty--Coleman, elliptic curve Chabauty, quadratic Chabauty, and the bielliptic quadratic Chabauty method combined with the Mordell-Weil sieve. Additionally, for square-free levels $N$, we classify all $\mathbb{Q}$-rational points as cusps, CM points (including their CM field and $j$-invariants) and exceptional ones. We further indicate how to use this …
This paper concerns towers of curves over a finite field with many rational points, following Garcia--Stichtenoth and Elkies. We present a new method to produce such towers. A key ingredient is the study of algebraic solutions to Fuchsian differential equations modulo $p$. We apply our results to towers of modular curves, and find new asymptotically good towers.
We study genus one curves that arise as 2-, 3- and 4-coverings of elliptic curves. We describe efficient algorithms for testing local solubility and modify the classical formulae for the covering maps so that they work in all characteristics. These ingredients are then combined to give explicit bounds relating the height of a rational point on one of the covering curves to the height of its image on the elliptic curve. We use our results to improve the existing methods for searching for rational points on elliptic curves.
We resolve a 1983 question of Serre by constructing curves with many points of every genus over every finite field. More precisely, we show that for every prime power q there is a positive constant c_q with the following property: for every non-negative integer g, there is a genus-g curve over F_q with at least c_q * g rational points over F_q. Moreover, we show that there exists a positive constant d such that for every q we can choose c_q = d * (log q). We show also that there is a constant c > 0 such that for every q and every n > 0, and for every sufficiently large g, there is a genus-g cu…
We find an asymptotic formula for the number of rational points near planar curves. More precisely, if $f:\mathbb{R}\rightarrow\mathbb{R}$ is a sufficiently smooth function defined on the interval $[η,ξ]$, then the number of rational points with denominator no larger than $Q$ that lie within a $δ$-neighborhood of the graph of $f$ is shown to be asymptotically equivalent to $(ξ-η)δQ^2$.
The explicit construction of function fields tower with many rational points relative to the genus in the tower play a key role for the construction of asymptotically good algebraic-geometric codes. In 1997 Garcia, Stichtenoth and Thomas [6] exhibited two recursive asymptotically good Kummer towers over any non-prime field. Wulftange determined the limit of one tower in his PhD thesis [13]. In this paper we determine the limit of another tower [14].
Let $Σ$ be a smooth projective surface, let $f' : S' \to Σ$ be a double cover of $Σ$ and let $μ: S \to S'$ be the canonical resolution. Put $f = f'\circμ$. An irreducible curve $C$ on $Σ$ is said to be a splitting curve with respect to $f$ if $f^*C$ is of the form $C^+ + C^- + E$, where $C^- = σ_f^*C^+$, $σ_f$ being the covering transformation of $f$ and all irreducible components of $E$ are contained in the exceptional set of $μ$. In this article, we show that a kind of "reciprocity" of splitting curves holds for a certain pair of curves on rational ruled surfaces. As an application, we consi…
The Littlewood Conjecture in Diophantine approximation can be thought of as a problem about covering the plane by a union of hyperbolas centered at rational points. In this paper we consider the problem of translating the center of each hyperbola by a random amount which depends on the denominator of the corresponding rational. Using a randomized covering argument we prove that, not only is this randomized version of the Littlewood Conjecture true for almost all choices of centers, an even stronger statement with an extra factor of a logarithm also holds.
Let N_{a,b}(x) count the number of primes p<=x with p dividing a^k+b^k for some k>=1. It is known that asymptotically N_{a,b}(x) grows like c(a,b)x/log x for some rational number c(a,b) that depends in a rather intricate way on a and b. A simple heuristic formula for N_{a,b}(x) is proposed and it is proved that it is asymptotically exact, i.e. has the same asymptotic behaviour as N_{a,b}(x). Connections with Ramanujan sums and character sums are discussed.
Let g be a non-zero rational number. Let N_{g,t}(x) denote the number of primes p<=x for which the subgroup of the multiplicative group of the finite field having p elements that is generated by g mod p is of residual index t. In Part I, which is published in J. Number Theory 83 (2000), 155-181, a heuristic for N_{g,t}(x) was set up, under the assumption of the Generalized Riemann Hypothesis (GRH), and shown to be asymptotically exact. In this preprint we provide an alternative and rather shorter proof of this result.
Let X be an algebraic curve over Q and t a non-constant Q-rational function on X such that Q(t) is a proper subfield of Q(X). For every integer n pick a point P_n on X such that t(P_n)=n. We conjecture that, for large N, among the number fields Q(P_1), ..., Q(P_N) there are at least cN distinct. We prove this conjecture in the special case when t defines a geometrically abelian covering of the projective line, and the critical values of t are all rational. This implies, in particular, that our conjecture follows from a famous conjecture of Schinzel.
Let $\mathcal A$ be a star-shaped polygon in the plane, with rational vertices, containing the origin. The number of primitive lattice points in the dilate $t\mathcal A$ is asymptotically $\frac6{π^2}$ Area$(t\mathcal A)$ as $t\to \infty$. We show that the error term is both $Ω_\pm\big( t\sqrt{\log\log t} \big)$ and $O(t(\log t)^{2/3}(\log\log t)^{4/3})$. Both bounds extend (to the above class of polygons) known results for the isosceles right triangle, which appear in the literature as bounds for the error term in the summatory function for Euler's $ϕ(n)$.
Let $E$ be an elliptic curve over a number field $K$. Descent calculations on $E$ can be used to find upper bounds for the rank of the Mordell-Weil group, and to compute covering curves that assist in the search for generators of this group. The general method of 4-descent, developed in the PhD theses of Siksek, Womack and Stamminger, has been implemented in Magma (when $K={\mathbb Q}$) and works well for elliptic curves with sufficiently small discriminant. By extending work of Bremner and Cassels, we describe the improvements that can be made when $E$ has a rational 2-torsion point. In parti…
Fractional parts of the first $N$ natural numbers fill the unit interval with asymptotically uniform density. However, the gaps around rational points shrink at an asymptotically lower rate $N^{-1/2}$, and their widths scale with the Thomae ("popcorn") function. This curious connection is derived and related geometrically to shadow pattern in the Euclid's orchard. Generalized cases of higher radicals and their convergence rates, are also investigated.