geometry-topology / Combinatorics, Discrete Geometry

Ziegler's Cross-Polytope Conjecture (simplicial 0/1-polytopes)

Ziegler proved every simplicial $d$-dimensional 0/1-polytope has at most $2d$ vertices, and asked whether attaining $2d$ vertices forces central symmetry (i.e. a 0/1 cross-polytope). Known true for $d \le 6$; open since ~2000.

15Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

geometry-topologyJun 30, 2026Significance 15/100Registry: unreviewed

Ziegler's Cross-Polytope Conjecture (simplicial 0/1-polytopes)

Prior state unknowndisproved

Ziegler proved every simplicial $d$-dimensional 0/1-polytope has at most $2d$ vertices, and asked whether attaining $2d$ vertices forces central symmetry (i.e. a 0/1 cross-polytope). Known true for $d \le 6$; open since ~2000.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

Ziegler proved every simplicial $d$-dimensional 0/1-polytope has at most $2d$ vertices, and asked whether attaining $2d$ vertices forces central symmetry (i.e. a 0/1 cross-polytope). Known true for $d \le 6$; open since ~2000.

Recorded attempts

Evidence graph

Connected research record

No public relationships recorded yet.