On Borsuk's conjecture for two-distance sets (Q2249469): Difference between revisions

For \(n \in \mathbb{N}\), \(b(n)\) denotes the smallest number \(k\) such that every bounded set of positive diameter in Euclidean space \(\mathbb{E}^n\) can be split into \(k\) subsets of smaller diameter. Borsuk asked if \(b(n)=n+1\) [\textit{K. Borsuk}, Fundam. Math. 20, 177--190 (1933; Zbl 0006.42403)]. The author shows that \(b(n)>n+1\) for all \(n \geq 65\). His estimates are mainly based on Euclidean representations of strongly regular graphs, which give finite sets in \(\mathbb{E}^n\) the mutual distances of whose points attain only two values. It is remarked that the answer to Borsuk's question is also negative for \(n=64\); namely, \(b(64) \geq 72\).