26 problems
Let be a polytope described by inequalities in dimension , and consider its vertex-edge graph. Hirsch conjecture. The diameter of the vertex-edge graph of is at most…
Let be the dimension of the classical associahedron. Sleator–Tarjan–Thurston conjecture. Its diameter is equal to as soon as . This conjecture concerns the exact di…
A polytope is neighborly if every set of at most vertices forms a face. For any pair , a cyclic polytope is a -dimensional polytope with vertice…
Let be a -dimensional polytope with facets, and let be a generic linear functional. Orient the graph of according to increasing values of , and de…
Cubical-polytope reconstruction conjecture. Every cubical polytope can be reconstructed from its dual graph.
Centrally symmetric cyclic upper bound conjecture. If is even, then the boundary complex of the -dimensional crosspolytope on vertices is the…
Hetyei's conjecture. There are cubical -polytopes whose -skeleton is not edge-orientable.
Let denote the polytope defined by Arkani-Hamed, Figueiredo, and Vazão in the kinematic-space construction described in the source. Its combinatorial o…
A Matryoshka is obtained from a subdivision of a polygon by sequentially wrapping groups of polygons into larger polygons. The cosmohedron is the polytope underlying the cosmologic…
A -maxout polytope is a polytope specified by the parameters , , and , and denotes the number of vertices of a polytope . Maxout polytopes vertex-numb…
A convex polytope is a bounded polyhedron; its diameter is the maximum graph distance between two vertices, where the graph has the vertices of the polytope and its edges. Let …
Spherical orbit-space conjecture. The space is homeomorphic to if and only if
Let denote the partial permutation polytope. Volume conjecture. The normalized volume of (equivalently, ) is equal…
Let denote the partial permutohedron. Volume conjecture. The normalized volume of is equal to . This conjecture gives a closed formula…
Let be the partial permutohedron and let be the Boolean lattice of subsets of . For a chain in , the difference between its l…
A cubical polytope is a polytope in which every facet is a cube. Its dual graph has one vertex for each facet, with two vertices adjacent when the corresponding facets share a ridg…
An inscribed zonotope is a zonotope whose vertices lie on a common sphere. A zonotope is combinatorially equivalent to another polytope if their face lattices are isomorphic. A…
Let be a simple polytope and let be a generic cost vector such that is the Hasse diagram of a lattice. A directed path in is said to re…
Monotonicity conjecture. is monotone if and only if is CM-monotone.
Let be a polytope, and let its -vector be the vector , where is the number of -dimensional proper faces of a -polytope. A vector…
Let , let be a triangulated -sphere with face numbers , and let denote its number of -faces. Generalized Lower Bound Conjecture. For ev…
Centrally symmetric realization conjecture. There is a -polytope combinatorially equivalent to such that
Let be an extremal set, and let be its Ball polytope. Call strongly critical if it has no proper subset which is extremal. Strong critical…
Let be a -polytope, and let be an extremal configuration; in fact, the source restricts to critical configurations. Write for the face…
Let be an extremal configuration. Call strongly critical if no proper subset of is extremal. Let denote its Ball polytope, and conside…