English
Related papers

Related papers: Borsuk's Problem in Metric Spaces

200 papers

The Borsuk conjecture and the V\'azsonyi problem are two attractive and famous questions in discrete and combinatorial geometry, both based on the notion of diameter of a bounded sets. In this paper, we present an equivalence between the…

Combinatorics · Mathematics 2025-07-24 Gyivan Lopez-Campos , Deborah Oliveros , Jorge L. Ramírez Alfonsín

Consider $n$ points evenly spaced on a circle, and a path of $n-1$ chords that uses each point once. There are $m=\lfloor n/2\rfloor$ possible chord lengths, so the path defines a multiset of $n-1$ elements drawn from $\{1,2,\ldots,m\}$.…

Combinatorics · Mathematics 2022-09-14 Brendan D. McKay , Tim Peters

A classic theorem of Euclidean geometry asserts that any noncollinear set of $n$ points in the plane determines at least $n$ distinct lines. Chen and Chv\'atal conjectured that this holds for an arbitrary finite metric space, with a certain…

Combinatorics · Mathematics 2014-12-30 Pierre Aboulker , Xiaomin Chen , Guangda Huzhang , Rohan Kapadia , Cathryn Supko

The dimension of a partially-ordered set (poset), introduced by Dushnik and Miller (1941), has been studied extensively in the literature. Recently, Ueckerdt (2016) proposed a variation called local dimension which makes use of partial…

Let $r \geq 2$, $n$ and $k$ be integers satisfying $k \leq \frac{r-1}{r}n$. In the original arXiv version of this note we suggested a conjecture that the family of all $k$-subsets of an $n$-set cannot be partitioned into fewer than $\lceil…

Combinatorics · Mathematics 2021-09-27 Noga Alon

Frechet's classical isometric embedding argument has evolved to become a major tool in the study of metric spaces. An important example of a Frechet embedding is Bourgain's embedding. The authors have recently shown that for every e>0 any…

Metric Geometry · Mathematics 2009-03-23 Yair Batal , Nathan Linial , Manor Mendel , Assaf Naor

Hanika, Schneider, and Stumme introduced geometric data set as a generalization of metric measure space for the computation of the observable diameter, and extended the observable distance between metric measure spaces to that between…

Metric Geometry · Mathematics 2026-03-25 Shigeaki Yokota

Geometrical objects with integral sides have attracted mathematicians for ages. For example, the problem to prove or to disprove the existence of a perfect box, that is, a rectangular parallelepiped with all edges, face diagonals and space…

Combinatorics · Mathematics 2019-11-12 Sascha Kurz , Reinhard Laue

In this paper we study the following problems: given a finite number of nonempty closed subsets of a normed space, find a ball with the smallest radius that encloses all of the sets, and find a ball with the smallest radius that intersects…

Optimization and Control · Mathematics 2012-01-04 Boris S. Mordukhovich , Nguyen Mau Nam , Cristina Villalobos

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…

Combinatorics · Mathematics 2025-12-02 Nikolai Avdeev

We discuss five simple functions on finite multisets of metric spaces. The first four are all metrics iff the underlying space is bounded and are complete metrics iff it is also complete. Two of them, and the fifth function, all generalise…

Metric Geometry · Mathematics 2011-09-23 Stephen M. Turner

Chv\'{a}tal and Klincsek (1980) gave an $O(n^3)$-time algorithm for the problem of finding a maximum-cardinality convex subset of an arbitrary given set $P$ of $n$ points in the plane. This paper examines a generalization of the problem,…

Computational Geometry · Computer Science 2021-08-31 Stephane Durocher , J. Mark Keil , Saeed Mehrabi , Debajyoti Mondal

A theorem of Tverberg from 1966 asserts that every set $X\subset\mathbb{R}^d$ of $n=T(d,r)=(d+1)(r-1)+1$ points can be partitioned into $r$ pairwise disjoint subsets, whose convex hulls have a point in common. Thus every such partition…

Combinatorics · Mathematics 2017-05-17 Moshe White

We consider the covering of a ball in certain normed spaces by its congruent subsets and show that if the finite number of sets is not greater than the dimensionality of the space, then the centre of the ball either belongs to the interior…

Functional Analysis · Mathematics 2017-08-07 Sergij V. Goncharov

We investigate decompositions of a graph into a small number of low diameter subgraphs. Let P(n,\epsilon,d) be the smallest k such that every graph G=(V,E) on n vertices has an edge partition E=E_0 \cup E_1 \cup ... \cup E_k such that |E_0|…

Combinatorics · Mathematics 2009-06-22 Jacob Fox , Benny Sudakov

A set of n non-collinear points in the Euclidean plane defines at least n different lines. Chen and Chv\'tal in 2008 conjectured that the same results is true in metric spaces for an adequate definition of line. More recently, it was…

Combinatorics · Mathematics 2024-10-30 Gabriela Araujo-Pardo , Martín Matamala , Juan P. Peña , José Zamora

Based on a result of Makeev, in 2012 Blagojevi\'c and Karasev proposed the following problem: given any positive integers $m$ and $1\leq \ell\leq k$, find the minimum dimension $d=\Delta(m;\ell/k)$ such that for any $m$ mass distributions…

Combinatorics · Mathematics 2024-03-12 Andres Mejia , Steven Simon , Jialin Zhang

Dimensional types of metric scattered spaces are investigated. Revised proofs of Mazurkiewicz-Sierpi\'nski and Knaster-Urbanik theorems are presented. Embeddable properties of countable metric spaces are generalized onto uncountable metric…

General Topology · Mathematics 2015-05-01 Szymon Plewik , Marta Walczyńska

We prove that every $n$-point metric space of negative type (and, in particular, every $n$-point subset of $L_1$) embeds into a Euclidean space with distortion $O(\sqrt{\log n} \cdot\log \log n)$, a result which is tight up to the iterated…

Metric Geometry · Mathematics 2007-05-23 Sanjeev Arora , James R. Lee , Assaf Naor

The partition problem is a well-known basic NP-complete problem. We mainly consider the optimization version of it in this paper. The problem has been investigated from various perspectives for a long time and can be solved efficiently in…

Discrete Mathematics · Computer Science 2024-05-10 Susumu Kubo