3 problems
- 0 votes0 replies0 views
The corank-three state-polytope four-neighbor conjecture
Corank-three four-neighbor conjecture. Every vertex in the state polytope of has at most four neighbors.
- 0 votes0 replies0 views
The state-polytope valency conjecture
State-polytope valency conjecture. The maximum valency of a vertex in the state polytope of is bounded above by a function depending only on the corank of .
- 0 votes0 replies0 views
Delannoy face-number conjecture for state polytopes of P(l,0,…,0)
Let and be positive integers, and let … For the polytope , write for the number of its faces of dimension . Delannoy face-number conjecture. The state pol…