Families of polytopal digraphs that do not satisfy the shelling property
David Avis, Hiroyuki Miyata, Sonoko Moriyama

TL;DR
This paper investigates polytopal digraphs that do not satisfy the shelling property, providing a stronger definition, a general construction method, and analyzing the property in the context of crosspolytopes.
Contribution
It introduces an equivalent, stronger shelling property, and develops a general construction for polytopal digraphs lacking this property in higher dimensions.
Findings
A stronger, equivalent shelling property is established.
A construction method extends 4D polytopes to higher dimensions with the property.
Analysis of shelling property strength in crosspolytopes.
Abstract
A polytopal digraph is an orientation of the skeleton of a convex polytope . The possible non-degenerate pivot operations of the simplex method in solving a linear program over can be represented as a special polytopal digraph known as an LP digraph. Presently there is no general characterization of which polytopal digraphs are LP digraphs, although four necessary properties are known: acyclicity, unique sink orientation(USO), the Holt-Klee property and the shelling property. The shelling property was introduced by Avis and Moriyama (2009), where two examples are given in dimensions of polytopal digraphs satisfying the first three properties but not the shelling property. The smaller of these examples has vertices. Avis, Miyata and Moriyama(2009) constructed for each and , a -polytope with vertices which has a polytopal digraph…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Advanced Combinatorial Mathematics · Advanced Graph Theory Research
