Related papers: Points at Rational Distance from the Vertices of a…

Let (P) denote the problem of existence of a point in the plane of a given triangle T, that is at rational distance from all the vertices of T. In this article, we provide a complete solution to (P) for all equilateral triangles.

We consider various problems related to finding points in $\Q^{2}$ and in $\Q^{3}$ which lie at rational distance from the vertices of some specified geometric object, for example, a square or rectangle in $\Q^{2}$, and a cube or…

For the given regular plane polygon and an arbitrary point in the plane of the polygon, the distances from the point to the vertices of the polygon are defined. We proved that there is one more non-congruent regular polygon having the…

For a triangle $\Delta$, let (P) denote the problem of the existence of points in the plane of $\Delta$, that are at rational distance to the 3 vertices of $\Delta$. Answer to (P) is known to be positive in the following situation: $\Delta$…

Here is a square problem: in a unit square, is there a point with four rational distances to the vertices? A probability argument suggests a negative answer. This paper proves several special cases of the square problem: if the point sits…

Place the vertices of a rectangle at $\{(0, \pm 1/2), (a, \pm 1/2)\}$, where $a$ is rational. We show that if $v_3(a) = 0$, then any point $(x,y)$ that is rational distance from all four vertices of the rectangle has either $v_3(x) < 0$ or…

For two non-congruent regular polygons of the same type, the method of finding the points in the plane at the equal distances to the vertices, is established. The existence of two points with this property is proved for two polygons with a…

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…

There exists "a square problem": in a unit square is there a point with four rational distances to the vertices? This problem is still regarded as unproved. Yang showed proofs for several special cases of the square problem. By the…

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…

Let P be a polygon with rational vertices in the plane. We show that for any finite odd-sized collection of translates of P, the area of the set of points lying in an odd number of these translates is bounded away from 0 by a constant…

We show that for any set of reals X there is a subset Y such X and Y have same Lebesgue outer measure and the distance between any two distinct points in Y is irrational.

Paul Erd\H{o}s and R. Daniel Mauldin asked a series of questions on certain types of polygons of area $1$, the vertices of which can be found in every planar set of infinite Lebesgue measure. We address two of these questions, one on cyclic…

The goal of this paper is to establish certain inequalities between the numbers of convex polytopes in the d-dimensional space "containing" and "avoiding" zero provided that their vertex sets are subsets of a given finite set of points in…

We prove that there exists a norm in the plane under which no n-point set determines more than O(n log n log log n) unit distances. Actually, most norms have this property, in the sense that their complement is a meager set in the metric…

We state the formula for the critical number of vertices of a convex lattice polygon that guarantees that the polygon contains at least one point of a given sublattice and give a partial proof of the formula. We show that the proof can be…

We prove that if $P$ is a set of $n$ points in $\mathbb{C}^2$, then either the points in $P$ determine $\Omega(n^{1-\epsilon})$ complex distances, or $P$ is contained in a line with slope $\pm i$. If the latter occurs then each pair of…

A rational distance set in the plane is a point set which has the property that all pairwise distances between its points are rational. Erd\H os and Ulam conjectured in 1945 that there is no dense rational distance set in the plane. In this…

By viewing the regular $N$-gon as the set of $N$th roots of unity in the complex plane we transform several questions regarding polygon diagonals into when a polynomial vanishes when evaluated at roots of unity. To study these solutions we…

Richard Guy asked for the largest set of points which can be placed in the plane so that their pairwise distances are rational numbers. In this article, we consider such a set of rational points restricted to a given hyperbola. To be…