Related papers: A Congruence Condition For The Four-Distance Probl…
We show that among any $n$ points in the unit cube one can find a triangle of area at most $n^{-2/3-c}$ for some absolute constant $c >0$. This gives the first non-trivial upper bound for the three-dimensional version of Heilbronn's…
A solution of the n-body problem in R^d is a relative equilibrium if all of the mutual distance between the bodies are constant. In other words, the bodies undergo a rigid motion. Here we investigate the possibility of partially rigid…
Starting from any given rational-sided, right triangle, for example the $(3,4,5)$-triangle with area $6$, we use Euclidean geometry to show that there are infinitely many other rational-sided, right triangles of the same area. We show…
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…
Let X be a real normed vector space and dim X \ge 2. Let d>0 be a fixed real number. We prove that if x,y \in X and ||x-y||/d is a rational number then there exists a finite set {x,y} \subseteq S(x,y) \subseteq X with the following…
In this paper, we prove a geometrical inequality which states that for any four points on a hemisphere with the unit radius, the largest sum of distances between the points is 4+4*sqrt(2). In our method, we have constructed a rectangular…
Using a two-dimensional version of the delta method, we establish an asymptotic formula for the number of rational points of bounded height on non-singular complete intersections of cubic and quadric hypersurfaces of dimension at least $23$…
A positive integer $A$ is called a congruent number if $A$ is the area of a right-angled triangle with three rational sides. Equivalently, $A$ is a congruent number if and only if the congruent number curve $y^2=x^3-A^2x$ has a rational…
A rational triangle is a triangle with rational side lengths. We consider three different families of rational triangles having a fixed side and whose vertices are rational points in the plane. We display a one-to-one correspondence between…
We study rationality problems for smooth complete intersections of two quadrics. We focus on the three-dimensional case, with a view toward understanding the invariants governing the rationality of a geometrically rational threefold over a…
We study the problem of finding a triangulation T of a planar point set S such as to minimize the expected distance between two points x and y chosen uniformly at random from S. By distance we mean the length of the shortest path between x…
A triangle with rational sides and rational area is called a rational triangle. In this paper we consider three problems of finding pairs of rational triangles which have a common circumradius as well as either a common perimeter or a…
The convergence of the projection algorithm for solving the convex feasibility problem for a family of closed convex sets, is in connection with the regularity properties of the family. In the paper [18] are pointed out four cases of such a…
The three distance theorem (also known as the three gap theorem or Steinhaus problem) states that, for any given real number $\alpha$ and integer $N$, there are at most three values for the distances between consecutive elements of the…
It has been known that the distribution of the random distances between two uniformly distributed points within a convex polygon can be obtained based on its chord length distribution (CLD). In this report, we first verify the existing…
Richard Guy asked the following question: can we find a triangle with rational sides, medians, and area? Such a triangle is called a \emph{perfect triangle} and no example has been found to date. It is widely believed that such a triangle…
Let $\mathscr{M}$ be a compact submanifold of $\mathbb{R}^{M}$. In this article we establish an asymptotic formula for the number of rational points within a given distance to $\mathscr{M}$ and with bounded denominators under the assumption…
Given a non-singular diagonal cubic hypersurface $X\subset\mathbb{P}^{n-1}$ over $\mathbb{F}_q(t)$ with $\mathrm{char} (\mathbb{F}_q)\neq 3$, we show that the number of rational points of height at most $|P|$ is $O(|P|^{3+\varepsilon})$ for…
We show by finding an explicit parametrization that a 4th degree surface which arises as a necessary condition for the existence of a perfect cuboid is a rational surface, i.e. birationally equivalent over $\mathbb Q$ to a plane.
In 1997, Erd\H{o}s asked whether for arbitrarily large $n$ there exists a set of $n$ points in $\mathbb{R}^2$ that determines $O(\frac{n}{\sqrt{\log n}})$ distinct distances while satisfying the local constraint that every 4-point subset…