English

Polytopes with low excess degree

Combinatorics 2024-05-28 v1

Abstract

We study the existence and structure of dd-polytopes for which the number f1f_1 of edges is small compared to the number f0f_0 of vertices. Our results are more elegantly expressed in terms of the excess degree of the polytope, defined as 2f1df02f_1-df_0. We show that the excess degree of a dd-polytope cannot lie in the range [d+3,2d7][d+3,2d-7], complementing the known result that values in the range [1,d3][1,d-3] are impossible. In particular, many pairs (f0,f1)(f_0,f_1) are not realised by any polytope. For dd-polytopes with excess degree d2d-2, strong structural results are known; we establish comparable results for excess degrees dd, d+2d+2, and 2d62d-6. Frequently, in polytopes with low excess degree, say at most 2d62d-6, the nonsimple vertices all have the same degree and they form either a face or a missing face. We show that excess degree d+1d+1 is possible only for d=3,5d=3,5, or 77, complementing the known result that an excess degree d1d-1 is possible only for d=3d=3 or 55.

Keywords

Cite

@article{arxiv.2405.16838,
  title  = {Polytopes with low excess degree},
  author = {Guillermo Pineda-Villavicencio and Jie Wang and David Yost},
  journal= {arXiv preprint arXiv:2405.16838},
  year   = {2024}
}

Comments

23 pages, 3 figures

R2 v1 2026-06-28T16:41:20.794Z