On Dantzig figures from graded lexicographic orders

Abstract

We construct two families of Dantzig figures, which are $(d,2d)$-polytopes with an antipodal vertex pair, from convex hulls of initial subsets for the graded lexicographic (grlex) and graded reverse lexicographic (grevlex) orders on ${\mathbb{Z}}_{\ge 0}^d$. These two polytopes have the same number of vertices, $\mathcal{O}(d^2)$, and the same number of edges, $\mathcal{O}(d^3)$, but are not combinatorially equivalent. We provide an explicit description of the vertices and the facets for both families and describe their graphs along with analyzing their basic properties such as the radius, diameter, existence of Hamiltonian circuits, and chromatic number. Moreover, we also analyze the edge expansions of these graphs.

arXiv comment27 pages, 3 figures

References in corpus (6)

• A counterexample to the Hirsch conjecture
• Plank theorems via successive inradii
• Convex hulls of superincreasing knapsacks and lexicographic orderings
• Edge-Graph Diameter Bounds for Convex Polytopes with Few Facets
• On the Expansion of Graphs of 0/1-Polytopes
• On lexicographic approximations of integer programs

Cited by in corpus (2)

• On lexicographic approximations of integer programs
• The Augmented Mixing Method: Computing High-Accuracy Primal-Dual Solutions to Large-Scale SDPs via Column Updates