OWR-4798-013 · Complete affirmative answer

The Klee–Novik Complexes B(i,d) Triangulate S^i × B^(d−i−1)

Manuscript 30 September 2026 · Online 30 September 2026

math.GTmath.COUnrefereed preprint

Abstract

For 0 ≤ i ≤ d − 2, Klee and Novik defined B(i,d) as the subcomplex of the boundary of the d-dimensional cross-polytope generated by the facets whose xy-words have at most i switches, and asked whether B(i,d) is a combinatorial triangulation of S^i × B^(d−i−1). We show that it is, for all 0 ≤ i ≤ d − 2. Klee and Novik observed that B(i,d) collapses onto the boundary of the (i+1)-dimensional cross-polytope and noted that it is therefore a disc bundle over S^i. We show that |B(i,d)| is in fact a product. That sphere is a join factor of the boundary of the d-dimensional cross-polytope, so it has a regular neighbourhood that is a product, and |B(i,d)| together with an outer collar is another regular neighbourhood of it; uniqueness of regular neighbourhoods gives the result. Consequently ∂B(i,d) is PL homeomorphic to S^i × S^(d−i−2), and a conjecture of Cohen, Klee and Pannell holds. This is an unrefereed note.

Record

Affiliation
Mercury Software GmbH
Result
Complete affirmative answer
Categories
math.GT · math.CO
Manuscript
30 September 2026
Online release
30 September 2026
Version
1.0
License
Creative Commons Attribution 4.0 International

Files and verification

The PDF is the canonical reading copy. The source archive contains the LaTeX manuscript, bibliography, reproducibility material, and audit documents without build artefacts.

Citation

Alper Ferudun, “The Klee–Novik Complexes B(i,d) Triangulate S^i × B^(d−i−1),” EulerSolve Research Papers, OWR-4798-013, 2026. https://doi.org/10.5281/zenodo.23063421.

BibTeX
@misc{Ferudun2026Owr4798013,
  author = {Ferudun, Alper},
  title = {The Klee–Novik Complexes B(i,d) Triangulate S^i × B^(d−i−1)},
  year = {2026},
  howpublished = {EulerSolve Research Papers},
  url = {https://eulersolve.org/papers/owr-4798-013/},
  doi = {10.5281/zenodo.23063421},
  note = {OWR-4798-013; unrefereed preprint}
}

More research papers

Show all 86 other papers

All 87 research papers →