A cubical antipodal theorem
classification
🧮 math.CO
math.GT
keywords
antipodalsetsleastmustpairridgestheoremcontain
read the original abstract
The classical Lusternik-Schnirelman-Borsuk theorem states that if a d-sphere is covered by d+1 closed sets, then at least one of the sets must contain a pair of antipodal points. In this paper, we prove a combinatorial version of this theorem for hypercubes. It is not hard to show that for any cover of the facets of a d-cube by d sets of facets, at least one such set contains a pair of antipodal ridges. However, we show that for any cover of the ridges of a d-cube by d sets of ridges, at least one set must contain a pair of antipodal k-faces, and we determine the maximum k for which this must occur, for all dimensions except d=5.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.