Enumerating neighborly polytopes and oriented matroids
Enumerating neighborly polytopes and oriented matroids
复制标题
枚举邻近多面体和定向拟阵
DOI:
10.1080/10586458.2015.1015084
复制
发表时间:
2015
影响因子:
0.5
通讯作者:
Hiroyuki Miyata and Arnau Padrol
中科院分区:
文献类型:
--
作者:
横山信彦;松本嘉寛;飯田圭一郎;薛宇孝;遠藤誠;中島康晴;大庭伸介;Hiroyuki Miyata and Arnau Padrol
Neighborly polytopes are those that maximize the number of faces in each dimension among all polytopes with the same number of vertices. Despite their extremal properties, they form a surprisingly rich class of polytopes, which has been widely studied and is the subject of many open problems and conjectures. In this article, we study the enumeration of neighborly polytopes beyond the cases that have been computed so far. To this end, we enumerate neighborly oriented matroids—a combinatorial abstraction of neighborly polytopes—of small rank and corank. In particular, if we denote by OM(r,n) the set of all oriented matroids of rankrandnelements, we determine all uniform neighborly oriented matroids in OM(5, ≤12), OM(6, ≤9), OM(7, ≤11), and OM(9, ≤12) and all possible face lattices of neighborly oriented matroids in OM(6, 10) and OM(8, 11). Moreover, we classify all possible face lattices of uniform 2-neighborly oriented matroids in OM(7, 10) and OM(8, 11). Based on the enumeration, we construct many interesting examples and test open conjectures.