Related papers: A Generalization in Space of Jung's Theorem

We present a method to assign, for any radius $r$ greater than about 12.44, one of seven colors to each point in $\mathbb{R}^3$ lying at distance $r$ from the origin, such that no two points at unit distance from each other are assigned the…

We describe the surjective isometries of the unit sphere of real Schreier spaces of all orders and their $p$-convexifications, for $1 < p < \infty$. This description allows us to provide for those spaces a positive answer to a special case…

Lagrange's Four Squares Theorem states that any positive integer can be expressed as the sum of four integer squares. We investigate the analogous question over Quaternion rings, focusing on squares of elements of Quaternion rings with…

Universal cover in $\mathbb{E}^{n}$ is a measurable set that contains a congruent copy of any set of diameter 1. Lebesgue's universal covering problem, posed in 1914, asks for the convex set of smallest area that serves as a universal cover…

Let $d,m_1,...,m_r$ be ($r+1$) positive integers, and $P_1,...,P_r$ be $r$ general points in the projective plane ; let $m$ be a positive integer. We prove that there exists a bound $d_0(m)$ such that : If $m_i < m$ ($0<i<r+1$), and $d >…

A recent generalization of the Erd\H{o}s Unit Distance Problem, proposed by Palsson, Senger and Sheffer, asks for the maximum number of unit distance paths with a given number of vertices in the plane and in $3$-space. Studying a variant of…

Consider the integer points lying on the sphere of fixed radius projected onto the unit sphere. Duke showed that, on congruence conditions for the radius squared, these points equidistribute. To further this study of equidistribution, we…

In this paper we answer Larman's question on Borsuk's conjecture for two-distance sets. We find a two-distance set consisting of 416 points on the unit sphere in the dimension 65 which cannot be partitioned into 83 parts of smaller…

We give a simple proof of a recent result by Kleinbock and Merrill concerning intrinsic approximations on sphere, in the simplest case of two-dimensional sphere in $\mathbb{R}^3$.

We give a new characterisation of inner product spaces amongst normed vector spaces in terms of the maximal cirumradius of spheres. It turns out that a normed vector space $(X,\norm{\cdot})$ with $\dim X\geq 2$ is an inner product space if…

In this paper we prove Schur's conjecture in $\mathbb R^d$, which states that any diameter graph $G$ in the Euclidean space $\mathbb R^d$ on $n$ vertices may have at most $n$ cliques of size $d$. We obtain an analogous statement for…

We improve Larman's bound on the diameter of a polytope by showing that if $\Delta$ is a normal simplicial complex, all of whose missing faces have size at most $r$, then the diameter of the facet-ridge graph of $\Delta$ is not larger than…

In 1946 Erd\H os asked for the maximum number of unit distances, $u(n)$, among $n$ points in the plane. He showed that $u(n)> n^{1+c/\log\log n}$ and conjectured that this was the true magnitude. The best known upper bound is…

In an accelerating universe in General Relativity there is a maximum radius above which a shell of test particles cannot collapse, but is dispersed by the cosmic expansion. This radius could be used in conjunction with observations of large…

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…

The following conjecture was proposed in 2010 by S. Lando. Let M and N be two unions of the same number of disjoint circles in a sphere. Then there exist two spheres in 3-space whose intersection is transversal and is a union of disjoint…

In this work we prove the following: let $K$ be a convex body in the Euclidean space $\mathbb{R}^n$, $n\geq 3$, contained in the interior of the unit ball of $\mathbb{R}^n$, and let $p\in \mathbb{R}^n$ be a point such that, from each point…

We prove existence and uniqueness of the minimizer for the average geodesic distance to the points of a geodesically convex set on the sphere. This implies a corresponding existence and uniqueness result for an optimal algorithm for…

A point set $M$ in $m$-dimensional Euclidean space is called an integral point set if all the distances between the elements of $M$ are integers, and $M$ is not situated on an $(m-1)$-dimensional hyperplane. We improve the linear lower…

Nagata has conjectured that the following statement (N_r) holds for all $r\geq 10$: (N_r) if $P_1,...P_r \in {\mathbb P}^2$ are generic points then any plane curve $C$ satisfies $\sum_1^r mult_{P_i}(C)\leq \sqrt{r} deg(C)$. Nagata proved…