HackerPapers

arXiv:2606.31640math.CO

A Counterexample to Ziegler's Cross-Polytope Conjecture for Simplicial 0/1-Polytopes

Volker Kaibel, Sebastian Pokutta

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

Ziegler proved that every simplicial $d$-dimensional $0/1$-polytope has at most $2d$ vertices, and asked whether equality forces the polytope to be centrally symmetric and hence, equivalently, a $0/1$-realization of the $d$-dimensional cross polytope. In this note, we give a negative answer, exhibiting an explicit set of $14$ vertices in $\{0,1\}^7$ whose convex hull is a simplicial $7$-polytope and is not centrally symmetric. Moreover, via exhaustive enumeration we show that up to the symmetries of the cube, there are precisely five such polytopes in dimension $7$ (of two combinatorial types) that are not centrally symmetric.

arXiv comments
fixed typo
Journal reference
DOI
Subjects
math.COCombinatorics math.OCOptimization and Control

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Aug 2026 to Aug 2026.

Comments linking this paper, per year.

Discussed in comments1 thread

    • There is money in this, so of course the closed models are far ahead. The open models will likely catch up a bit at some point, just as Stockfish caught up to AlphaZero. That being said, there are already a couple. It seems Deepseek has a claimed proof to the "Ziegler's…

      traesView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.