Search arXivSearch

arXiv · 2606.31640

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

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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Volker Kaibel, Sebastian Pokutta. 2026-07-02. A Counterexample to Ziegler's Cross-Polytope Conjecture for Simplicial 0/1-Polytopes. https://arxiv.org/abs/2606.31640

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO