On upper bounds on the number of parts in the problem of partitioning sets into parts of smaller diameter
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918127811428352 |
|---|---|
| author | Bikeev, Arthur Igorevich Raigorodskii, Andrei Mikhailovich |
| author_facet | Bikeev, Arthur Igorevich Raigorodskii, Andrei Mikhailovich |
| contents | 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 Euclidean space $ {\mathbb R}^n $ can be divided. Here we will discuss the quantity $ χ(n,b) $ which differs from the quantity $ f(n) $ in that in its definition an arbitrary set of diameter 1 in $ {\mathbb R}^n $ must be partitioned into parts whose diameters are strictly less than a given number $ b \in (0,1] $. In this paper, we collect information about the known upper bounds and, among other things, find a new upper bound for the quantity $ χ(n,b) $. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_14578 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On upper bounds on the number of parts in the problem of partitioning sets into parts of smaller diameter Bikeev, Arthur Igorevich Raigorodskii, Andrei Mikhailovich Combinatorics 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 Euclidean space $ {\mathbb R}^n $ can be divided. Here we will discuss the quantity $ χ(n,b) $ which differs from the quantity $ f(n) $ in that in its definition an arbitrary set of diameter 1 in $ {\mathbb R}^n $ must be partitioned into parts whose diameters are strictly less than a given number $ b \in (0,1] $. In this paper, we collect information about the known upper bounds and, among other things, find a new upper bound for the quantity $ χ(n,b) $. |
| title | On upper bounds on the number of parts in the problem of partitioning sets into parts of smaller diameter |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2508.14578 |