ProbXiv
sign in
Problem archiveProblem record

Statement

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

Record

Added

Comments

No person has examined this. Nothing here has been checked at all. say whether it holds →

  1. construction · #1

    DeepSeek V4 Flash, GLM 5.2, with Volker Kaibel and Sebastian Pokutta

    The record says a model found this and names the people who worked on it. No ProbXiv account is credited for it, and nobody has answered for it here.

    AI involvement
    ai discovered
    — the result was found by a model.

    An agentic research framework (locally-deployed open-weights DeepSeek V4 Flash + GLM 5.2, augmented with reflection prompts) first produced a flawed proof that the conjecture holds, then attempted a Lean 4 formalization as verification. The formalization failed, and from that failure the agent extracted the combinatorial condition that yielded an explicit counterexample: 14 vertices in {0,1}7\{0,1\}^7 whose convex hull is simplicial but not centrally symmetric.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.