English
Related papers

Related papers: On Borsuk's conjecture for two-distance sets

200 papers

The union-closed sets conjecture (Frankl's conjecture) says that for any finite union-closed family of finite sets, other than the family consisting only of the empty set, there exists an element that belongs to at least half of the sets in…

Combinatorics · Mathematics 2019-07-03 Zhen Cui , Ze-Chun Hu

We construct a nonseparable Banach space $\mathcal X$ (actually, of density continuum) such that any uncountable subset $\mathcal Y$ of the unit sphere of $\mathcal X$ contains uncountably many points distant by less than $1$ (in fact, by…

Functional Analysis · Mathematics 2021-06-09 Piotr Koszmider

A finite subset of a Euclidean space is called an $s$-distance set if there exist exactly $s$ values of the Euclidean distances between two distinct points in the set. In this paper, we prove that the maximum cardinality among all…

Metric Geometry · Mathematics 2020-09-29 Hiroshi Nozaki , Masashi Shinohara

A reformulation of the three circles theorem of Johnson with distance coordinates to the vertices of a triangle is explicitly represented in a polynomial system and solved by symbolic computation. A similar polynomial system in distance…

Metric Geometry · Mathematics 2025-04-11 Marco Longinetti , Simone Naldi

The bisector of two nonempty sets P and Q in a metric space is the set of all points with equal distance to P and to Q. A distance k-sector of P and Q, where k is an integer, is a (k-1)-tuple (C_1, C_2, ..., C_{k-1}) such that C_i is the…

Computational Geometry · Computer Science 2010-07-19 Keiko Imai , Akitoshi Kawamura , Jiří Matoušek , Daniel Reem , Takeshi Tokuyama

We study Borsuk-Ulam type results for the loopspace of an euclidean sphere without loops equal to their inverses.

Algebraic Topology · Mathematics 2018-04-18 Dariusz Miklaszewski

Alternative novel measures of the distance between any two partitions of a n-set are proposed and compared, together with a main existing one, namely 'partition-distance' D(.,.). The comparison achieves by checking their restriction to…

Discrete Mathematics · Computer Science 2011-06-24 Giovanni Rossi

We obtain new lower bounds on the Hausdorff dimension of distance sets and pinned distance sets of planar Borel sets of dimension slightly larger than $1$, improving recent estimates of Keleti and Shmerkin, and of Liu in this regime. In…

Classical Analysis and ODEs · Mathematics 2018-11-09 Pablo Shmerkin

A subset $X$ in the $d$-dimensional Euclidean space is called a $k$-distance set if there are exactly $k$ distances between two distinct points in $X$. Einhorn and Schoenberg conjectured that the vertices of the regular icosahedron is the…

Metric Geometry · Mathematics 2013-09-10 Masashi Shinohara

We show that for any large $n$, there exists a set of $n$ points in the plane with $O(n^2/\sqrt{\log n})$ distinct distances, such that any four points in the set determine at least five distinct distances. This answers (in the negative) a…

Combinatorics · Mathematics 2024-09-04 Terence Tao

We show that almost all natural numbers n not divisible by 4, and not congruent to 7 modulo 8, are represented as the sum of three squares, one of which is the square of an integer no larger than (log n)^{1+e} (any e>0). This answers a…

Number Theory · Mathematics 2022-02-14 Trevor D. Wooley

We prove new versions of the isomorphic Busemann-Petty problem for two different measures and show how these results can be used to recover slicing and distance inequalities. We also prove a sharp upper estimate for the outer volume ratio…

Functional Analysis · Mathematics 2019-12-03 Alexander Koldobsky , Grigoris Paouris , Artem Zvavitch

The Johnson-Lindenstrauss Lemma is a classic result which implies that any set of n real vectors can be compressed to O(log n) dimensions while only distorting pairwise Euclidean distances by a constant factor. Here we consider potential…

Quantum Physics · Physics 2011-10-27 Aram W. Harrow , Ashley Montanaro , Anthony J. Short

We study characteristics which might distinguish two-graphs by introducing different numerical measures on the collection of graphs on $n$ vertices. Two conjectures are stated, one using these numerical measures and the other using the deck…

Combinatorics · Mathematics 2008-10-20 David M. Duncan , Thomas R. Hoffman , James P. Solazzo

Estimates of the fractal dimension $D$ of the set of galaxies in the universe, based on ever improving data sets, tend to settle on $D\approx 2$. This result raised a raging debate due to its glaring contradiction with astrophysical models…

The Frankl conjecture, also known as the union-closed sets conjecture, states that in any finite non-empty union-closed family, there exists an element in at least half of the sets. From an optimization point of view, one could instead…

Combinatorics · Mathematics 2016-08-03 Jonad Pulaj , Annie Raymond , Dirk Theis

In this paper we prove a conjecture on the dimension of linear systems, with base points of multiplicity 2 and 3, on an Hirzebruck surface.

Algebraic Geometry · Mathematics 2010-03-17 Antonio Laface

A subset $S$ of the unit sphere $\mathbb{S}^2$ is called orthogonal-pair-free if and only if there do not exist two distinct points $u, v \in S$ at distance $\frac{\pi}{2}$ from each other. Witsenhausen \cite{witsenhausen} asked the…

Computational Geometry · Computer Science 2024-03-28 Apurva Mudgal

The Falconer conjecture asserts that if E is a planar set with Hausdorff dimension strictly greater than 1, then its Euclidean distance set has positive one-dimensional Lebesgue measure. We discuss the analogous question with the Euclidean…

Metric Geometry · Mathematics 2007-05-23 Sergei Konyagin , Izabella Laba

The classical Lusternik-Schnirelman-Borsuk theorem states that if a d-sphere is covered by d+1 closed sets, then at least one of the sets must contain a pair of antipodal points. In this paper, we prove a combinatorial version of this…

Combinatorics · Mathematics 2009-09-03 Kyle E. Kinneberg , Aaron Mazel-Gee , Tia Sondjaja , Francis Edward Su