Related papers: Points at rational distances from the vertices of …
We give uniform upper bounds for the number of rational points of height at most $B$ on non-singular complete intersections of two quadrics in $\mathbb{P}^3$ defined over $\mathbb{Q}$. To do this, we combine determinant methods with descent…
We investigate the Hasse principle for complete intersections cut out by a quadric and cubic hypersurface defined over the rational numbers.
The correspondence between right triangles with rational sides, triplets of rational squares in arithmetic succession and integral solutions of certain quadratic forms is well known. We show how this correspondence can be extended to the…
There are many papers studying properties of point sets in the Euclidean space $\mathbb{E}^m$ or on integer grids $\mathbb{Z}^m$, with pairwise integral or rational distances. In this article we consider the distances or coordinates of the…
In this paper we study sets of points in the plane with rational distances from r prescribed points P_1, ...,P_r. A crucial case arises for r = 3, where we provide simple necessary and sufficient conditions for the density of this set in…
Motivated by problems arising in the relative trace formula and arithmetic invariant theory we prove the existence of rational points on orbits arising from certain infinitesimal symmetric spaces. As an application, we prove analogous…
The problem of bounding of the distance between the two bodies of volume $\varepsilon$ located inside the $n$-dimensional body $B$ of unit volume where $n \to \infty$ is considered. In some cases such distances are bounded by function…
Given a polygonal curve P, a pointset S, and an \epsilon > 0, we study the problem of finding a polygonal curve Q whose vertices are from S and has a Frechet distance less or equal to \epsilon to curve P. In this problem, Q must visit every…
Many questions about triangles and quadrilaterals with rational sides, diagonals and areas can be reduced to solving certain Diophantine equations. We look at a number of such questions including the question of approximating arbitrary…
This is a study of a problem in geodesy with methods from complex algebraic geometry: for a fixed number of measure points and target points at unknown position in the Euclidean plane, we study the problem of determining their relative…
We present an approach to a large class of enumerative problems concerning rational curves in projective spaces. This approach uses analysis to obtain topological information about moduli spaces of stable maps. We demonstrate it by…
We look at the elliptic curve E(q), where q is a fixed rational number. A point (p,r) on E(q) is called a rational point if both p and r are rational numbers. We introduce the concept of conjugate points and show that not both can be…
Upper and lower bounds, of the expected order of magnitude, are obtained for the number of rational points of bounded height on any quartic del Pezzo surface over $\mathbb{Q}$ that contains a conic defined over $\mathbb{Q}$.
We consider the problem of optimizing the product of the distances from a given point in a triangle to each vertex. There are two possible cases in general. For isosceles triangles, we explicitly show exactly when both cases occur.
For any constant $d$ and parameter $\varepsilon > 0$, we show the existence of (roughly) $1/\varepsilon^d$ orderings on the unit cube $[0,1)^d$, such that any two points $p,q\in [0,1)^d$ that are close together under the Euclidean metric…
We prove that for any of a wide class of elliptic surfaces $X$ defined over a number field $k$, if there is an algebraic point on $X$ that lies on only finitely many rational curves, then there is an algebraic point on $X$ that lies on no…
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…
We show that large subsets of vector spaces over finite fields determine certain point configurations with prescribed distance structure. More specifically, we consider the complete graph with vertices as the points of $A \subseteq…
Given a simple polygon $P$ and a set $Q$ of points contained in $P$, we consider the geodesic $k$-center problem where we want to find $k$ points, called \emph{centers}, in $P$ to minimize the maximum geodesic distance of any point of $Q$…
If $S$ is a given regular $d$-simplex of edge length $a$ in the $d$-dimensional Euclidean space $\mathcal{E}$, then the distances $t_1$, $\cdots$, $t_{d+1}$ of an arbitrary point in $\mathcal{E}$ to the vertices of $S$ are related by the…