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

In this paper we obtain rigidity results for a bounded non-constant entire solution $u$ of the Allen-Cahn equation in $\mathbb{R}^n$, whose level set $\{u=0\}$ is contained in a half-space. If $n\leq 3$ we prove that the solution must be…

The Four Vertex Theorem, one of the earliest results in global differential geometry, says that a simple closed curve in the plane, other than a circle, must have at least four "vertices", that is, at least four points where the curvature…

In this paper we study a generalized version of the Weber problem of finding a point that minimizes the sum of its distances to a finite number of given points. In our setting these distances may be $cut$ $off$ at a given value $C > 0$, and…

We study the rationality of the intersection points of certain lines and smooth plane quartics C defined over F_q. For q \geq 127, we prove the existence of a line such that the intersection points with C are all rational. Using another…

In this paper, we examine how well a rational point P on an algebraic variety X can be approximated by other rational points. We conjecture that if P lies on a rational curve, then the best approximations to P on X can be chosen to lie…

For any three nonzero vectors $a,b,c$ in $\mathbb R^2$, we obtain a necessary and sufficient condition for the sum of the three pairwise angles between these vectors to equal $2\pi$. As an easy consequence of this, a proof of Euclid's…

In this paper we study the art gallery problem, which is one of the fundamental problems in computational geometry. The objective is to place a minimum number of guards inside a simple polygon such that the guards together can see the whole…

Ptolemy's inequality is a classic relationship between the distances among four points in Euclidean space. Another relationship between six distances is the 4-point condition, an inequality satisfied by the lengths of the six paths that…

The weighted Fermat-Torricelli problem for four non-collinear and non-coplanar points in the three dimensional Euclidean Space states that: Given four non-collinear and non-coplanar points A1, A2, A3, A4 and a positive real number (weight)…

This paper is concerned with the density of rational points of bounded height lying on a variety defined by an integral quadratic form Q. In the case of four variables, we give an estimate that does not depend on the coefficients of Q. For…

A sequence of rational points on an algebraic planar curve is said to form an $r$-geometric progression sequence if either the abscissae or the ordinates of these points form a geometric progression sequence with ratio $r$. In this work, we…

We consider the practical computation of rational points on y^2=x(x^2+ax+b). The algebra necessary for a 4-descent procedure is described. A simple further descent is then described which only uses integer arithmetic. Numerous examples are…

Here we examine some Erdos-Falconer-type problems in vector spaces over finite fields involving right angles. Our main goals are to show that a) a subset A of F_q^d of size >> q^[(d+2)/3] contains three points which generate a right angle,…

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…

We begin by revisiting a paper of Erd\H{o}s and Fishburn, which posed the following question: given $k\in \mathbb{N}$, what is the maximum number of points in a plane that determine at most $k$ distinct distances, and can such optimal…

An old question posed by Erd\H{o}s asked whether there exists a set of $n$ points such that $c \cdot n$ distances occur more than $n$ times. We provide an affirmative answer to this question, showing that there exists a set of $n$ points…

We give a characterization of all three points in $\mathbb R^4$ with integer coordinates which are at the same Euclidean distance apart. In three dimension the problem is characterized in terms of solutions of the Diophantine equations…

We consider the problem of finding all enclosing rectangles of minimum area that can contain a given set of rectangles without overlap. Our rectangle packer chooses the x-coordinates of all the rectangles before any of the y-coordinates. We…

Fix $d \ge 3$. We show the existence of a constant $c>0$ such that any graph of diameter at most $d$ has average distance at most $d-c \frac{d^{3/2}}{\sqrt n}$, where $n$ is the number of vertices. Moreover, we exhibit graphs certifying…

The three-dimensional linear regression problem is a problem of finding a spacial straight line best fitting a group of points in three-dimensional Euclidean space. This problem is considered in the present paper and a solution to it is…