中文
相关论文

相关论文: Reducing the upper bound for the Borsuk number in …

200 篇论文

Borsuk conjectured that every n-dimensional bounded set of positive diameter can be partitioned into n+1 sets of smaller diameters. This conjecture was proved for n=2 by Borsuk, for n=3 first by Eggleston, and disproved for n > 297 by…

度量几何 · 数学 2010-08-12 Zsolt Langi

In the present paper, we study problems related to the classical Borsuk's problem. Recall that the Borsuk's problem consists in finding the smallest number $ f(n) $ of parts of smaller diameter into which an arbitrary set of diameter 1 in…

组合数学 · 数学 2025-08-21 Arthur Igorevich Bikeev , Andrei Mikhailovich Raigorodskii

The Borsuk number of a set S of diameter d >0 in Euclidean n-space is the smallest value of m such that S can be partitioned into m sets of diameters less than d. Our aim is to generalize this notion in the following way: The k-fold Borsuk…

度量几何 · 数学 2013-11-05 M. Hujter , Z. Lángi

Quantitative estimates related to the classical Borsuk problem of splitting set in Euclidean space into subsets of smaller diameter are considered. For a given $k$ there is a minimal diameter of subsets at which there exists a covering with…

度量几何 · 数学 2022-10-25 Alexander Tolmachev , Dmitry Protasov , Vsevolod Voronov

In 1933, Borsuk made a conjecture that every $n$-dimensional bounded set can be divided into $n+1$ subsets of smaller diameter. Up to now, the problem is still open for $4\leq n\leq 63$. In this paper, we firstly discuss the Banach-Mazur…

度量几何 · 数学 2022-07-04 Jun Wang , Fei Xue

It is presented the simplest known disproof of the Borsuk conjecture stating that if a bounded subset of n-dimensional Euclidean space contains more than n points, then the subset can be partitioned into n+1 nonempty parts of smaller…

组合数学 · 数学 2018-10-02 A. Skopenkov

In 1933, Karol Borsuk asked whether each bounded set in the $n$-dimensional Euclidean space can be divided into $n$+1 parts of smaller diameter. Because it would not make sense otherwise, one usually assumes that he just forgot to require…

组合数学 · 数学 2025-03-14 Thomas Jenrich

In the papers Ziegler(2001) and Goldstein(2012) it was previously shown that any subset of the Boolean cube $ S \subset \{0,1\}^n $ for $ n \leq 9 $ can be partitioned into $n+1$ parts of smaller diameter, i.e., the Borsuk conjecture holds…

组合数学 · 数学 2025-04-03 Igor Batmanov , Vsevolod Voronov

Let $f(d)$ be the smallest number so that every set in $R^d$ of diameter 1 can be partitioned into $f(d)$ sets of diameter smaller than 1. Borsuk's conjecture was that $f(d)\! =\!d\!+\!1$. We prove that $f(d)\! \ge\! (1.2)^{\sqrt d}$ for…

度量几何 · 数学 2008-02-03 Jeff Kahn , Gil Kalai

In 1933 Karol Borsuk asked whether each bounded set in the n-dimensional Euclidean space can be divided into n+1 parts of smaller diameter. The diameter of a set is defined as the supremum (least upper bound) of the distances of contained…

度量几何 · 数学 2014-08-21 Thomas Jenrich

Hujter and L\'angi introduced the $k$-fold Borsuk number of a set $S$ in Euclidean $n$-space of diameter $d > 0$ as the smallest cardinality of a family $\mathcal F$ of subsets of $S$, of diameters strictly less than $d$, such that every…

度量几何 · 数学 2013-11-27 Zsolt Lángi , Márton Naszódi

The Borsuk problem asks for the smallest number of subsets with strictly smaller diameters into which any bounded set in the $d$-dimensional space can be decomposed. It is a classical problem in combinatorial geometry that has been subject…

组合数学 · 数学 2026-04-14 José Cáceres , Delia Garijo , Alberto Márquez , Rodrigo I. Silveira

In 1933, K. Borsuk proposed the following problem: Can every bounded set in $\mathbb{E}^n$ be divided into $n+1$ subsets of smaller diameters? In 1965, V. G. Boltyanski and I. T. Gohberg made the following conjecture: Every bounded set in…

度量几何 · 数学 2022-10-13 Jun Wang , Fei Xue , Chuanming Zong

Classical Borsuk problem asks about the minimal number of closed subsets of smaller diameter necessary to partition every compact in the Euclidean space. Topological version of the Borsuk problem is discussed.

组合数学 · 数学 2007-05-23 Yan Soibelman

Borsuk's conjecture states that any bounded set in R^n can be partitioned into n+1 sets of smaller diameter. It is known to be false for all n bigger or equal to 323. Here we show that Borsuk's conjecture fails in dimensions 321 and 322.…

组合数学 · 数学 2007-05-23 Oleg Pikhurko

For each natural number n >= 4, we determine the unique lowest volume hyperbolic 3-orbifold whose torsion orders are bounded below by n. This lowest volume orbifold has base space the 3-sphere and singular locus the figure-8 knot, marked n.…

几何拓扑 · 数学 2017-05-09 Christopher K. Atkinson , David Futer

In 1933, Borsuk proposed the following problem: Can every bounded set in $\mathbb{E}^n$ be divided into $n+1$ subsets of smaller diameters? This problem has been studied by many authors, and a lot of partial results have been discovered. In…

度量几何 · 数学 2020-01-14 Chuanming Zong

The aim of this paper is to demonstrate relations between Gromov-Hausdorff distance properties and the Borsuk Conjecture. The Borsuk number of a given bounded metric space $X$ is the infimum of cardinal numbers $n$ such that $X$ can be…

一般拓扑 · 数学 2022-03-15 Alexander Ivanov , Alexey Tuzhilin

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…

组合数学 · 数学 2017-12-01 Andrei Kupavskii , Andrei Raigorodskii

In 1933, Borsuk conjectured that any bounded d-dimensional set of nonzero diameter can be broken into d + 1 parts of smaller diameter. This conjecture was disproved for large enough d, though it is true for low dimensional cases. The paper…

度量几何 · 数学 2010-10-12 Dian Yang
‹ 上一页 1 2 3 10 下一页 ›