Related papers: A Congruence Condition For The Four-Distance Probl…

A rational distance set is a subset of the plane such that the distance between any two points is a rational number. We show, assuming Lang's Conjecture, that the cardinalities of rational distance sets in general position are uniformly…

We study side-lengths of triangles in path metric spaces. We prove that unless such a space X is bounded, or quasi-isometric to line or half-line, every triple of real numbers satisfying the strict triangle inequalities, is realized by the…

Let $f(t,y,y')=\sum_{i=0}^n a_i(t,y)y'^i=0$ be an irreducible first order ordinary differential equation with polynomial coefficients. Eremenko in 1998 proved that there exists a constant $C$ such that every rational solution of…

It is easy to find a right-angled triangle with integer sides whose area is 6. There is no such triangle with area 5, but there is one with rational sides (a `\emph{Pythagorean triangle}'). For historical reasons, integers such as 6 or 5…

We determine exactly which positive rational numbers occur as squared edge lengths of regular $d$-simplices with vertices in $\mathbb{Q}^n$. The answer exhibits a sharp stabilization phenomenon: once $n-d\geq 3$, every positive rational…

This paper considers an extremal version of the Erd\H{o}s distinct distances problem. For a point set $P \subset \mathbb R^d$, let $\Delta(P)$ denote the set of all Euclidean distances determined by $P$. Our main result is the following: if…

In this article we establish an asymptotic formula for the number of rational points, with bounded denominators, within a given distance to a compact submanifold $\mathcal{M}$ of $\mathbb{R}^M$ with a certain curvature condition. Our result…

We show that if a disc triangulation has all internal vertex degrees at least 6, then the full triangulation may be determined from the pairwise graph distance between boundary vertices. A similar result holds for quadrangulations with all…

If the $\ell$-adic cohomology of a projective smooth variety, defined over a local field $K$ with finite residue field $k$, is supported in codimension $\ge 1$, then every model over the ring of integers of $K$ has a $k$-rational point. For…

A set in $\mathbb R^d$ is called almost-equidistant if for any three distinct points in the set, some two are at unit distance apart. First, we give a short proof of the result of Bezdek and L\'angi claiming that an almost-equidistant set…

In this paper, we study the cardinality of the distance set $\Delta(A, B)$ determined by two subsets $A$ and $B$ of the $d$-dimensional vector space over a finite field $\mathbb{F}_q$. Assuming that $A$ or $B$ lies in a $k$-coordinate plane…

A long series of previous papers have been devoted to the (one-dimensional) moment problem with nonnegative rational measure. The rationality assumption is a complexity constraint motivated by applications where a parameterization of the…

We consider intersections of n diagonal forms of degrees k 1 < $\bullet$ $\bullet$ $\bullet$ < kn, and we prove an asymptotic formula for the number of rational points of bounded height on these varieties. The proof uses the…

Problems in optimization and geometric probability are discussed, all connected with angles subtended at an observer's eye by an object at a distance. Several of these remain unsolved.

For $S \subseteq \mathbb{R}$, positive integer $n$, and $d > 0$, let $G(S^n, d)$ be the graph whose vertex set is $S^n$ where any two vertices are adjacent if and only if they are Euclidean distance $d$ apart. The primary question we will…

The main result of this note is that there are at most seven rational points (including the one at infinity) on the curve C_A with the affine equation y^2 = x^5 + A (where A is a tenth power free integer) when the Mordell-Weil rank of the…

Given a continuous function $f:[a,b]\to\mathbb{R}$ such that $f(a)=f(b)$, we investigate the set of distances $|x-y|$ where $f(x)=f(y)$. In particular, we show that the only distances this set must contain are ones which evenly divide…

We survey theoretical, algorithmic, and computational results at the intersection of distance geometry problems and mathematical programming, both with and without adjacencies as part of the input. While mathematical programming methods can…

The Erd\H{o}s-Anning theorem states that every point set in the Euclidean plane with integer distances must be either collinear or finite. More strongly, for any (non-degenerate) triangle of diameter~$\delta$, at most $O(\delta^2)$ points…

Let $G$ be a finite, connected graph. The average distance of a vertex $v$ of $G$ is the arithmetic mean of the distances from $v$ to all other vertices of $G$. The remoteness $\rho(G)$ and the proximity $\pi(G)$ of $G$ are the maximum and…