We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Borsuk's partition conjecture.
- Authors
Zong, Chuanming
- Abstract
In 1933, Borsuk proposed the following problem: Can every bounded set in E n be divided into n + 1 subsets of smaller diameter? 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 challenging problem.
- Subjects
LOGICAL prediction; COMPUTER software; DIAMETER
- Publication
Japanese Journal of Mathematics, 2021, Vol 16, Issue 2, p185
- ISSN
0289-2316
- Publication type
Article
- DOI
10.1007/s11537-021-2007-7