Related papers: Rational points on complete intersections over $\m…
We prove that a geometrically integral smooth 3-fold $X$ with nef anti-canonical class and negative Kodaira dimension over a finite field $\mathbb{F}_q$ of characteristic $p>5$ and cardinality $q=p^e > 19$ has a rational point.…
Let X be a projective cubic hypersurface of dimension 11 or more, which is defined over the rationals. In this paper it is shown that X contains rational points provided that the cubic form defining X can be written as the sum of two forms…
Let $k$ be a number field. In the spirit of a result by Yongqi Liang, we relate the arithmetic of rational points over finite extensions of $k$ to that of zero-cycles over $k$ for Kummer varieties over $k$. For example, for any Kummer…
We study the number of rational points of smooth projective curves over finite fields in some relative situations in the spirit of a previous paper from an euclidean point of vue. We prove some kinds of relative Weil bounds, derived from…
Given integers s,t, define a function phi_{s,t} on the space of all formal series expansions by phi_{s,t} (sum a_n x^n) = sum a_{sn+t} x^n. For each function phi_{s,t}, we determine the collection of all rational functions whose Taylor…
Bounding the number of preperiodic points of quadratic polynomials with rational coefficients is one case of the Uniform Boundedness Conjecture in arithmetic dynamics. Here, we provide a general framework that may reduce finding periodic…
We determine the set $S(d)$ of possible prime orders of $K$-rational points on elliptic curves over number fields $K$ of degree $d$, for $d = 4$, $5$, $6$, and $7$.
In this paper, the proof of the existence of a rational point on an elliptic curve is transformed into the proof of the existence of an integer solution for a Diophantine equation. By a new formula for calculating the number of elements in…
We strengthen the classical approximation theorems of Weierstrass, Runge and Mergelyan by showing the polynomial and rational approximants can be taken to have a simple geometric structure. In particular, when approximating a function $f$…
Given a set $S$ of elements in a number field $k$, we discuss the existence of planar algebraic curves over $k$ which possess rational points whose $x$-coordinates are exactly the elements of $S$. If the size $|S|$ of $S$ is either $4,5$,…
Given a smooth subscheme of a projective space over a finite field, we compute the probability that its intersection with a fixed number of hypersurface sections of large degree is smooth of the expected dimension. This generalizes the case…
We show that measures of irrationality on very general codimension two complete intersections and very general complete intersection surfaces are multiplicative in the degrees of the defining equations. This confirms some cases of a…
Let K be a function field in one variable over an arbitrary field F. Given a rational function f(z) in K(z) of degree at least two, the associated canonical height on the projective line was defined by Call and Silverman. The preperiodic…
Functions with singularities are notoriously difficult to approximate with conventional approximation schemes. In computational applications, they are often resolved with low-order piecewise polynomials, multilevel schemes, or other types…
We give a construction of singular curves with many rational points over finite fields. This construction enables us to prove some results on the maximum number of rational points on an absolutely irreducible projective algebraic curve…
For an analytic function $f(z)=\sum_{k=0}^\infty a_kz^k$ on a neighbourhood of a closed disc $D\subset {\bf C}$, we give assumptions, in terms of the Taylor coefficients $a_k$ of $f$, under which the number of intersection points of the…
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 give quantitative bounds for the number of quasi-integral points in orbits of semigroups of rational maps under some conditions, generalizing previous work of L. C. Hsia and J. Silverman (2011) for orbits generated by the iterations of…
Recent years have witnessed the introduction and development of extremely fast rational function algorithms. Many ideas in this realm arose from polynomial-based linear-algebraic algorithms. However, polynomial approximation is occasionally…
Let K be an algebraically closed field of characteristic zero. Given a polynomial f(x,y) in K[x,y] with one place at infinity, we prove that either f is equivalent to a coordinate, or the family (f+c) has at most two rational elements. When…