Related papers: Visible Points On Exponential Curves
Combining $2$-descent techniques with Riemann-Roch and B\'ezout's theorems, we give an upper bound on the number of rational points of bounded height on elliptic and hyperelliptic curves over function fields of characteristic $\neq 2$. We…
In characteristic $p>0$ and for $q$ a power of $p$, we compute the number of nonplanar rational curves of arbitrary degrees on a smooth Hermitian surface of degree $q+1$ under the assumption that the curves have a parametrization given by…
We put a new conjecture on primes from the point of view of its binary expansions and make a step towards justification.
We show, assuming Schanuel's conjecture, that every irreducible complex polynomial in two variables where both variables appear has infinitely many algebraically independent solutions of the form (z,e^z).
We give a bound, linear in the complexity of the surface, on the asymptotic dimension of the curve complex as well as the capacity dimension of the ending lamination space.
We give a completely explicit upper bound for integral points on (standard) affine models of hyperelliptic curves, provided we know at least one rational point and a Mordell-Weil basis of the Jacobian. We also explain a powerful refinement…
We give an explicit formula for the exponents (i.e. the spectra up to the shift by one) of an irreducible plane curve singularity in terms of Puiseux pairs. As an application we prove in this case Hertling's conjecture that the variance…
We prove a complex polynomial of degree $n$ has at most $\lceil n/2 \rceil$ attractive fixed points lying on a line. We also consider the general case.
Let $S$ be a closed orientable hyperbolic surface, and let $\mathcal{O}(K,S)$ denote the number of mapping class group orbits of curves on $S$ with at most $K$ self-intersections. Building on work of Sapir [16], we give upper and lower…
Ihara's proof that the reduction of the modular curve $X_0(n)$ at a prime $p$ not dividing $n$ has many points over a quadratic extension is adapted to the drinfeld modular curves $X_0(n)$. In order to do so, some properties of drinfeld…
We present some results about the number of rational points on a certain family of curves defined over a finite field. In a small number of cases the curves have more rational points than expected. Fibonacci numbers make an appearance, as…
A point on a plane curve is said to be Galois (for the curve) if the projection from the point as a map from the curve to a line induces a Galois extension of function fields. It is known that the number of Galois points is finite except…
One of the goals of this paper is to prove that the index of intersection of two complex curves in a two-dimensional complex manifold tangent to each other at a common boundary point is positive. This is achieved via the construction of a…
The concept of a visible point of a convex set relative to a given point is introduced. A number of basic properties of such visible point sets is developed. In particular, it is shown that this concept is useful in the study of best…
We give an upper bound on the number of perfect matchings in simple graphs with a given number of vertices and edges. We apply this result to give an upper bound on the number of 2-factors in a directed complete bipartite balanced graph on…
We give a formula computing the number of one-nodal rational curves that pass through an appropriate collection of constraints in a complex projective space. We combine the methods and results from three different papers.
Let K be a finite field. We know that a half of elements of K* is a square. So it is natural to ask how many of them appear as x-coordinate of points on an elliptic curve over K. We consider a specific class of elliptic curves over finite…
We describe an algorithm to compute the number of points over finite fields on a broad class of modular curves: we consider quotients $X_H/W$ for $H$ a subgroup of $\GL_2(\mathbb Z/n\mathbb Z)$ such that for each prime $p$ dividing $n$, the…
For a prime $p$ and an integer $a \in \Z$ we obtain nontrivial upper bounds on the number of solutions to the congruence $x^x \equiv a \pmod p$, $1 \le x \le p-1$. We use these estimates to estimate the number of solutions to the congruence…
We consider extending the visibility polygon of a given point $q$, inside a simple polygon $P$ by converting some edges of $P$ to mirrors. We will show that several variations of the problem of finding mirror-edges to add precisely $k$…