中文
相关论文

相关论文: Borsuk's Conjecture Fails in Dimensions 321 and 32…

200 篇论文

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…

组合数学 · 数学 2021-09-27 Noga Alon

In the concluding remarks of their 1993 published and now famous paper, Jeff Kahn and Gil Kalai wrote in particular: "Our construction shows that Borsuk's conjecture is false for d = 1,325 and for every d > 2,014." But, as Bernulf Weiszbach…

组合数学 · 数学 2018-10-12 Thomas Jenrich

In 1993, Kahn and Kalai famously constructed a sequence of finite sets in $d$-dimensional Euclidean spaces that cannot be partitioned into less than $(1.203\ldots+o(1))^{\sqrt{d}}$ parts of smaller diameter. Their method works not only for…

度量几何 · 数学 2024-07-04 Andrei M. Raigorodskii , Arsenii Sagdeev

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

For positive integers $s$ and $L \geq 3$, Berkovich and Uncu (Ann. Comb. $23$ ($2019$) $263$--$284$) conjectured an inequality between the sizes of two closely related sets of partitions whose parts lie in the interval $\{s, \ldots, L+s\}$.…

组合数学 · 数学 2021-08-16 Damanvir Singh Binner , Amarpreet Rattan

In the present paper the following Generalized Borsuk Problem is studied: Can a given bounded metric space $X$ be partitioned into a given number $m$ (probably an infinite one) of subsets, each of which has a smaller diameter than $X$? We…

度量几何 · 数学 2019-06-26 Alexander Ivanov , Alexei Tuzhilin

The purpose of this article is to demonstrate the connection between the properties of the Gromov--Hausdorff distance and the Borsuk conjecture. The Borsuk number of a given bounded metric space $X$ is the infimum of cardinal numbers $n$…

度量几何 · 数学 2022-03-09 Alexander O. Ivanov , Alexey A. Tuzhilin

It is proved that the suspension of a closed n-dimensional manifold M, $n\ge1$, does not embed in a product of n+1 curves. In fact, the ultimate result will be proved in a much more general setting. This is a far-reaching generalization the…

几何拓扑 · 数学 2009-06-26 J. Krasinkiewicz , S. Spiez

We pose the following conjecture: (*) If A is the union of line segments in R^n, and B is the union of the corresponding full lines then the Hausdorff dimensions of A and B agree. We prove that this conjecture would imply that every…

度量几何 · 数学 2018-03-12 Tamás Keleti

For a compact set $A$ in $\mathbb{R}^n$ the Hausdorff distance from $A$ to $\text{conv}(A)$ is defined by \begin{equation*} d(A):=\sup_{a\in\text{conv}(A)}\inf_{x\in A}|x-a|, \end{equation*} where for $x=(x_1,\dots,x_n)\in\mathbb{R}^n$ we…

度量几何 · 数学 2024-07-18 Mark Meyer

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

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

We study the Hausdorff dimension of self-similar sets and measures on the line. We show that if the dimension is smaller than the minimum of 1 and the similarity dimension, then at small scales there are super-exponentially close cylinders.…

经典分析与常微分方程 · 数学 2014-09-23 Michael Hochman

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…

组合数学 · 数学 2025-07-24 Gyivan Lopez-Campos , Deborah Oliveros , Jorge L. Ramírez Alfonsín

In 1924, S. Banach and A. Tarski proved an astonishing, yet rather counterintuitive paradox: given a solid ball in $\mathbb{R}^3$, it is possible to partition it into finitely many pieces and reassemble them to form two solid balls, each…

历史与综述 · 数学 2022-06-01 Katie Buchhorn

We begin a systematic study of the region of possible values of the volumes of Minkowski subset sums of a collection of $M$ compact sets in $\mathbb{R}^d$, which we call the Lyusternik region, and make some first steps towards describing…

组合数学 · 数学 2024-03-13 Franck Barthe , Mokshay Madiman

O. H. Keller conjectured in 1930 that in any tiling of $\Bbb R^n$ by unit $n$-cubes there exist two of them having a complete facet in common. O. Perron proved this conjecture for $n\le 6$. We show that for all $n\ge 10$ there exists a…

度量几何 · 数学 2016-09-06 Jeffrey C. Lagarias , Peter W. Shor

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

Karasev conjectured that for any set of $3k$ lines in general position in the plane, which is partitioned into $3$ color classes of equal size $k$, the set can be partitioned into $k$ colorful 3-subsets such that all the triangles formed by…

组合数学 · 数学 2018-05-15 Seunghun Lee , Kangmin Yoo

The Hirsch conjecture was posed in 1957 in a letter from Warren M. Hirsch to George Dantzig. It states that the graph of a d-dimensional polytope with n facets cannot have diameter greater than n - d. Despite being one of the most…

组合数学 · 数学 2013-10-29 Edward D. Kim , Francisco Santos