English
Related papers

Related papers: Around the Petty theorem on equilateral sets

200 papers

A set in $\mathbb R^d$ is called almost-equidistant if for any three distinct points in the set, some two are at unit distance apart. First, we give a short proof of the result of Bezdek and L\'angi claiming that an almost-equidistant set…

Metric Geometry · Mathematics 2019-04-18 Alexandr Polyanskii

Similarly to the classic notion in $E^d$, a subset of a positive diameter below $\frac{\pi}{2}$ of a hemisphere of the sphere $S^d$ is called complete, provided adding any extra point increases its diameter. Complete sets are convex bodies…

Metric Geometry · Mathematics 2020-10-08 Marek Lassak

We prove the following variant of Levi's Enlargement Lemma: for an arbitrary arrangement $\mathcal{A}$ of $x$-monotone pseudosegments in the plane and a pair of points $a,b$ with distinct $x$-coordinates and not on the same pseudosegment,…

Combinatorics · Mathematics 2025-10-02 Jan Kynčl , Jan Soukup

We prove that subsets of ${\Bbb R}^d$, $d \ge 4$ of large enough Hausdorff dimensions contain vertices of an equilateral triangle. It is known that additional hypotheses are needed to assure the existence of equilateral triangles in two…

Classical Analysis and ODEs · Mathematics 2016-03-08 Alex Iosevich , Bochen Liu

The van der Waerden's theorem reads that an equilateral pentagon in Euclidean 3-space $\Bbb E^3$ with all diagonals of the same length is necessarily planar and its vertex set coincides with the vertex set of some convex regular pentagon.…

Metric Geometry · Mathematics 2016-05-12 Victor Alexandrov

One of the oldest and richest problems from continuous location science is the famous Fermat-Torricelli problem, asking for the unique point in Euclidean space that has minimal distance sum to n given (non-collinear) points. Many natural…

Metric Geometry · Mathematics 2016-01-08 Thomas Jahn , Yaakov S. Kupitz , Horst Martini , Christian Richter

The Erdos-Szekeres theorem states that for any natural k there is a natural number g(k) such that any set of at least g(k) points on a plane in general position contains a set of k points that are the extreme points of a convex polytope. We…

Combinatorics · Mathematics 2007-05-23 Iosif Pinelis

The Cheeger constant of an open set of the Euclidean space is defined by minimizing the ratio "perimeter over volume", among all its smooth compactly contained subsets. We consider a natural variant of this problem, where the volume of…

Analysis of PDEs · Mathematics 2024-04-08 Lorenzo Brasco

The Busemann-Petty problem asks whether origin symmetric convex bodies in $\R^n$ with smaller hyperplane sections necessarily have smaller volume. The answer is affirmative if $n\leq 3$ and negative if $n\geq 4.$ We consider a class of…

Functional Analysis · Mathematics 2008-11-20 Marisa Zymonopoulou

For convex partitions of a convex body $B$ we prove that we can put a homothetic copy of $B$ into each set of the partition so that the sum of homothety coefficients is $\ge 1$. In the plane the partition may be arbitrary, while in higher…

Combinatorics · Mathematics 2012-12-27 Arseniy Akopyan , Roman Karasev

An equilateral set (or regular simplex) in a metric space $X$, is a set $A$ such that the distance between any pair of distinct members of $A$ is a constant. An equilateral set is standard if the distance between distinct members is equal…

Functional Analysis · Mathematics 2014-11-10 Emmanuel Chetcuti , Joseph Muscat

If a convex body $K \subset \mathbb{R}^n$ is covered by the union of convex bodies $C_1, \ldots, C_N$, multiple subadditivity questions can be asked. Two classical results regard the subadditivity of the width (the smallest distance between…

Metric Geometry · Mathematics 2020-09-16 Alexey Balitskiy

Following ideas of Iriyeh and Shibata we give a short proof of the three-dimensional Mahler conjecture {\mf for symmetric convex bodies}. Our contributions include, in particular, simple self-contained proofs of their two key statements.…

Metric Geometry · Mathematics 2021-01-21 Matthieu Fradelizi , Alfredo Hubard , Mathieu Meyer , Edgardo Roldán-Pensado , Artem Zvavitch

In this paper, extending the work of Gal'perin (Comm. Math. Phys. 154: 63-84, 1993), we investigate generalizations of the concepts of centroids and static equilibrium points of a convex body in spherical, hyperbolic and normed spaces. In…

Metric Geometry · Mathematics 2026-02-11 Z. Lángi , S. Wang

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…

General Mathematics · Mathematics 2021-05-14 Yang Ji

In a normed linear space X an element x is said to be orthogonal to another element y in the sense of Birkhoff-James, written as $ x \perp_{B}y, $ iff $ \| x \| \leq \| x + \lambda y \| $ for all scalars $ \lambda.$ We prove that a normed…

Functional Analysis · Mathematics 2024-07-30 Debmalya Sain , Kallol Paul , Kanhaiya Jha

We introduce complex intersection bodies and show that their properties and applications are similar to those of their real counterparts. In particular, we generalize Busemann's theorem to the complex case by proving that complex…

Functional Analysis · Mathematics 2014-02-26 A. Koldobsky , G. Paouris , M. Zymonopoulou

In a countably normed space which is a linear space equipped with a countable number of pair-wise compatible norms, we prove the existence of a common nearest point (in all norms) from a point outside a nonempty subset if this subset is…

Functional Analysis · Mathematics 2022-12-14 Moustafa M. Zakaria , Nashat Faried , Hany A. El-Sharkawy

Let $\mathcal{P}$ be a set of points in the plane, and $\mathcal{S}$ a strictly convex set of points. In this note, we show that if $\mathcal{P}$ contains many translates of $\mathcal{S}$, then these translates must come from a generalized…

Combinatorics · Mathematics 2023-02-28 Gabriel Currier , Jozsef Solymosi , Ethan Patrick White

A planar point set is in convex position precisely when it has a convex polygonization, that is, a polygonization with maximum interior angle measure at most \pi. We can thus talk about the convexity of a set of points in terms of the…

Computational Geometry · Computer Science 2014-09-16 Danny Rorabaugh