129 problems
Let be an oriented matroid of rank , let , and let denote its positive circuits. An -positive circuit is a positive circ…
3-geodesic conjecture. For every -dimensional Dantzig figure ,
Strong Dantzig conjecture. Every fundamental deformation of a -dimensional Dantzig figure is good; equivalently,
Dantzig conjecture. The graph is strongly connected: for any vertices of , there is an oriented path from to .
Face-structure conjectures for tropical polytopes. The following assertions hold: (1) -faces of tropical polytopes are extreme sets; (2) the topological boundary of a -face i…
Tropical halfspace characterization conjecture. A tropical polytope is pure and full dimensional if and only if it has a halfspace description whose apices are in general posit…
Tropical halfspace representation conjecture. If is pure, then the halfspaces from a generic lift of map to tropical halfspaces whose intersection is its…
Combinatorial characterization conjecture. If the assignment satisfies 1. for every such decomposition,
Let be the metric polytope, and let its fractional vertices be the vertices that are not integral. The restriction of to its fractional vertices i…
Partition characterization. Every minimal halfspace with respect to has the form
A tropical -plane in -space is a tropical linear space of dimension in -space. Let be a face dimension, and map the space to the quotient by the diagonal line: … A…
Collapsing conjecture. Suppose that
Let be the number of faces of an irreducible -hedrite, and let a central circuit be a central circuit of the hedrite. An irreducible -hedrite is maximal irreducible when…
Oriented-multicut adjacency conjecture. (i) An oriented multicut is not adjacent to every oriented multicut such that . (ii) The orbit represented…
Oriented-multicut facet conjecture. The following inequalities define facets of : (i) zero-extensions of every facet of , including oriented triangle and non-…
Oriented-multicut skeleton conjecture. (i) All oriented multicuts are extreme rays of . (ii) The oriented cuts form a dominating clique in ; consequently, the…
Adjacency and diameter conjecture. (i) A triangle facet is adjacent to a facet if and only if they are non-conflicting. (ii) The non-negativity facets and are…
Let be the cone of nonnegative -hemimetrics. Denote by an -simplex facet and by a nonnegativity facet. Let…
Let , , and be the corresponding cones of -hemimetrics, and let the ridge graph of a cone have the facets as vertices, with adjacency when two facets me…
Let be the ground set, and let and be two partition -hemimetrics on . Two rays are adjacent when they generate…
Let be a square-free monomial ideal generated in degree and having a linear presentation. Let be the graph whose vertices are the minimal mono…
Let be the collection of graphs whose vertices are labeled by -subsets of an -element set, with the property that for vertices labeled by and , th…
Symmetric capacity conjecture. The symmetric capacity satisfies
For each integer , let be the integral polytope whose integer points correspond to irreducible Ferrers-diagram pairs…
Mihail–Vazirani conjecture. Every polytope satisfies