A Computer Program for Borsuk's Conjecture
Metric Geometry
2020-01-14 v1
Abstract
In 1933, Borsuk proposed the following problem: Can every bounded set in be divided into subsets of smaller diameters? This problem has been studied by many authors, and a lot of partial results have been discovered. In particular, Kahn and Kalai's counterexamples surprised the mathematical community in 1993. Nevertheless, the problem is still far away from being completely resolved. This paper presents a broad review on related subjects and, based on a novel reformulation, introduces a computer proof program to deal with this well-known problem.
Cite
@article{arxiv.2001.03720,
title = {A Computer Program for Borsuk's Conjecture},
author = {Chuanming Zong},
journal= {arXiv preprint arXiv:2001.03720},
year = {2020}
}
Comments
10 pages, 3 figures