Embedding a pair of graphs in a surface, and the width of 4-dimensional prismatoids
Combinatorics
2011-04-18 v2 Computational Geometry
Abstract
A prismatoid is a polytope with all its vertices contained in two parallel facets, called its bases. Its width is the number of steps needed to go from one base to the other in the dual graph. The author recently showed in arXiv:1006.2814 that the existence of counter-examples to the Hirsch conjecture is equivalent to that of -prismatoids of width larger than , and constructed such prismatoids in dimension five. Here we show that the same is impossible in dimension four. This is proved by looking at the pair of graph embeddings on a 2-sphere that arise from the normal fans of the two bases of .
Cite
@article{arxiv.1102.2645,
title = {Embedding a pair of graphs in a surface, and the width of 4-dimensional prismatoids},
author = {Francisco Santos},
journal= {arXiv preprint arXiv:1102.2645},
year = {2011}
}
Comments
This paper and arXiv:1101.3050 have been merged, forming now the paper arXiv:1104.2630