English

On Dantzig figures from graded lexicographic orders

Combinatorics 2018-03-28 v4 Optimization and Control

Abstract

We construct two families of Dantzig figures, which are (d,2d)(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 Z0d\mathbb{Z}^{d}_{\geq 0}. These two polytopes have the same number of vertices, O(d2)\mathcal{O}(d^{2}), and the same number of edges, O(d3)\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.

Keywords

Cite

@article{arxiv.1612.06332,
  title  = {On Dantzig figures from graded lexicographic orders},
  author = {Akshay Gupte and Svetlana Poznanović},
  journal= {arXiv preprint arXiv:1612.06332},
  year   = {2018}
}

Comments

27 pages, 3 figures

R2 v1 2026-06-22T17:28:35.932Z