Related papers: Visible Points On Exponential Curves

For a prime $p$ and an absolutely irreducible modulo $p$ polynomial $f(U,V) \in \Z[U,V]$ we obtain an asymptotic formulas for the number of solutions to the congruence $f(x,y) \equiv a \pmod p$ in positive integers $x \le X$, $y \le Y$,…

This paper concerns the number of lattice points in the plane which are visible along certain curves to all elements in some set S of lattice points simultaneously. By proposing the concept of level of visibility, we are able to analyze…

We give effective upper bounds for the number of purely inseparable points on non isotrivial curves over function fields of positive characteristic and of transcendence degree one. These bounds depend on the genus of the curve, the genus of…

We derive a new bound for some bilinear sums over points of an elliptic curve over a finite field. We use this bound to improve a series of previous results on various exponential sums and some arithmetic problems involving points on…

We prove that integral points can be effectively determined on all but finitely many modular curves, and on all but one modular curve of prime power level.

For small odd primes $p$, we prove that most of the rational points on the modular curve $X_0(p)/w_p$ parametrize pairs of elliptic curves having infinitely many supersingular primes. This result extends the class of elliptic curves for…

In this paper we shall investigate the problem of the representation of the number of integral points of an elliptic curve modulo a prime number p. We present a way of expressing an exponential sum which involves polynomials of third…

We estimate the maximal number of integral points which can be on a convex arc in the plane with given length, minimal radius of curvature and initial slope.

We give bounds on the number of non-simple closed curves on a negatively curved surface, given upper bounds on both length and self-intersection number. In particular, it was previously known that the number of all closed curves of length…

We provide in this paper an upper bound for the number of rational points on a curve defined over a one variable function field over a finite field. The bound only depends on the curve and the field, but not on the Jacobian variety of the…

For every $n\geq 3$, we exhibit infinitely many extremal effective divisors on the moduli space of genus one curves with $n$ marked points.

We establish sharp lower and upper bounds for the number of integral points near dilations of a space curve with nowhere vanishing torsion.

We give examples of sequences of smooth non-isotrivial curves for every genus at least two, defined over a rational function field of positive characteristic, such that the (finite) number of rational points of the curves in the sequence…

We prove upper bounds for the number of rational points on non-singular cubic curves defined over the rationals. The bounds are uniform in the curve and involve the rank of the corresponding Jacobian. The method used in the proof is a…

Given an elliptic curve $E$ and a positive integer $N$, we consider the problem of counting the number of primes $p$ for which the reduction of $E$ modulo $p$ possesses exactly $N$ points over $\mathbb F_p$. On average (over a family of…

In this study, we determine all modular curves $X_0(N)$ that admit infinitely many cubic points.

We obtain new bounds of exponential sums modulo a prime $p$ with sparse polynomials $a_0x^{n_0} + \cdots + a_{\nu}x^{n_\nu}$. The bounds depend on various greatest common divisors of exponents $n_0, \ldots, n_\nu$ and their differences. In…

For prime powers q<100, we compute new upper and lower bounds on N_q(4), the maximal number of points on a genus-4 curve over a finite field with q elements. We determine the exact value of N_q(4) for 17 prime powers q for which the value…

In this paper, we give a constant $C$ in \cite[Theorem 1.2]{sha2014bounding} by using an explicit Baker's inequality, hence we have an explicit bound of the integral points on modular curves.

We give explicit numerical estimates for the generalized Chebyshev functions. Explicit results of this kind are useful for estimating of computational complexity of algorithms which generates special primes. Such primes are needed to…