Borsuk's Conjecture Fails in Dimensions 321 and 322
Oleg Pikhurko
Abstract
Borsuk's conjecture states that any bounded set in Rn 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. (This result has been independently discovered by Hinrichs and Richter.)
Create a lesson
Related papers
Counting with Hiccup Sequences
Benoit Cloitre
Degree similar and net-degree similar signed graphs
Matteo Cavaleri, Alfredo Donno
Clique and chromatic numbers of graph powers: spectral bounds and anticodes
Aida Abiad, Gabriel Coutinho, Hitesh Kumar et al.
Counting cographs in locally dense graphs
Hyunwoo Lee
Two-orbit right-angled Polytopes and Hypertopes
Claudio Alexandre Piedade, Philippe Tranchida
On the failure of additivity of inversion numbers for dijoins
Natalie Behague, Jack Cromwell