English
Related papers

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

200 papers

In this paper we investigate the Erd\"os/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We prove a good upper bound for spherical means that have been…

Classical Analysis and ODEs · Mathematics 2007-05-23 Alex Iosevich , Misha Rudnev

We prove existence of equal area partitions of the unit sphere via optimal transport methods, accompanied by diameter bounds written in terms of Monge--Kantorovich distances. This can be used to obtain bounds on the expectation of the…

Optimization and Control · Mathematics 2025-02-21 Jun Kitagawa , Asuka Takatsu

In this paper, we mainly consider the problem of spherical distribution of 5 points, that is, how to configure 5 points on a sphere such that the mutual distance sum attains the maximum. It is conjectured that the sum of distances is…

Discrete Mathematics · Computer Science 2009-06-05 Xiaorong Hou , Junwei Shao

We prove a limit theorem for the the maximal interpoint distance (also called the diameter) for a sample of n i.i.d. points in the unit ball of dimension 2 or more. The exact form of the limit distribution and the required normalisation are…

Probability · Mathematics 2007-05-23 Michael Mayer , Ilya Molchanov

It is shown that given a set of $N$ points in the plane or on the sphere, there is a subset of size $\gtrsim N^{1/3}/\log N$ with all pairwise distances between points distinct.

Combinatorics · Mathematics 2014-04-08 Marcos Charalambides

In this paper, we prove that two different observers don't equally measure the distance between two points A and B. For this, we introduce some postulates and obtain a new formula to show distance between A and B. In this formula, radius of…

General Physics · Physics 2007-05-23 M. Akbari , M. T. Darvishi

We give a new proof of Steinitz's classical theorem in the case of plane triangulations, which allows us to obtain a new general bound on the grid size of the simplicial polytope realizing a given triangulation, subexponential in a number…

Combinatorics · Mathematics 2013-11-05 Igor Pak , Stedman Wilson

We prove that if a complete connected $n$-dimensional Riemannian manifold $M$ has radial sectional curvature at a base point $p\in M$ bounded from below by the radial curvature function of a two-sphere of revolution $\widetilde M$ belonging…

Differential Geometry · Mathematics 2016-07-19 Nathaphon Boonnam

Given a sphere of any radius $r$ in an $n$-dimensional Euclidean space, we study the coverings of this sphere with solid spheres of radius one. Our goal is to design a covering of the lowest covering density, which defines the average…

Metric Geometry · Mathematics 2018-05-22 Ilya Dumer

In this paper we show that the number of distinct distances determined by a set of $n$ points on a constant-degree two-dimensional algebraic variety $V$ (i.e., a surface) in $\mathbb R^3$ is at least $\Omega\left(n^{7/9}/{\rm polylog}…

Combinatorics · Mathematics 2016-04-07 Micha Sharir , Noam Solomon

We show two sphere theorems for the Riemannian manifolds with scalar curvature bounded below and the non-collapsed $\mathrm{RCD}(n-1,n)$ spaces with mean distance close to $\frac{\pi}{2}$.

Differential Geometry · Mathematics 2022-06-06 Jialong Deng

Any function from a round $n$-dimensional sphere of radius $r$ into $n$-dimensional Euclidean space must distort the metric additively by at least $\displaystyle \frac{\pi r}{1 + \sqrt{1 - \frac{2}{n+2}}}$ if $n$ is even and $\displaystyle…

Metric Geometry · Mathematics 2026-05-01 James Dibble

In this paper we study the geometry of metric spheres in the curve complex of a surface, with the goal of determining the "average" distance between points on a given sphere. Averaging is not technically possible because metric spheres in…

Geometric Topology · Mathematics 2012-05-01 Spencer Dowdall , Moon Duchin , Howard Masur

In this paper, we prove two theorems concerning the sums of squared distances between points on a unit $n$-sphere that generalize two facts previously known about the case where the points are the vertices of a regular polygon. The first…

Metric Geometry · Mathematics 2020-01-10 Jessica N. Copher

An ordinary circle of a set $P$ of $n$ points in the plane is defined as a circle that contains exactly three points of $P$. We show that if $P$ is not contained in a line or a circle, then $P$ spans at least $\frac{1}{4}n^2 - O(n)$…

We show that the maximum number of unit distances or of diameters in a set of n points in d-dimensional Euclidean space is attained only by specific types of Lenz constructions, for all d >= 4 and n sufficiently large, depending on d. As a…

Metric Geometry · Mathematics 2009-03-12 Konrad J Swanepoel

We show that in Euclidean 3-space any closed curve $\gamma$ which contains the unit sphere within its convex hull has length $L\geq4\pi$, and characterize the case of equality. This result generalizes the authors' recent solution to a…

Differential Geometry · Mathematics 2024-03-27 Mohammad Ghomi , James Wenk

In this work, the classical Borsuk conjecture is discussed, which states that any set of diameter 1 in the Euclidean space $ {\mathbb R}^d $ can be divided into $ d+1 $ parts of smaller diameter. During the last two decades, many…

Combinatorics · Mathematics 2017-12-01 Andrei Kupavskii , Andrei Raigorodskii

This is the eighth and final paper in a series giving a proof of the Kepler conjecture, which asserts that the density of a packing of congruent spheres in three dimensions is never greater than $\pi/\sqrt{18}\approx 0.74048...$. This is…

Metric Geometry · Mathematics 2007-05-23 Thomas C. Hales

Menger's theorem says that, for $k\ge0$, if $S, T$ are sets of vertices in a graph $G$, then either there are $k + 1$ vertex-disjoint paths between $S$ and $T$, or there is a set X of at most $k$ vertices such that every $S$-$T$ path passes…

Combinatorics · Mathematics 2025-09-10 Tung Nguyen , Alex Scott , Paul Seymour