arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1204.0645math.CO
收藏

小可实现定向拟阵的完备enumeration

Complete enumeration of small realizable oriented matroids

Komei Fukuda, Hiroyuki Miyata, Sonoko Moriyama

摘要:

点构形和多面体的所有组合类型的计数是组合几何中的一个基本问题。虽然已有许多研究,但大多数都是针对二维非退化情形。Finschi和Fukuda(2001)发表了第一个定向拟阵数据库,其中包括退化(即非均匀)拟阵和高阶拟阵。在本文中,我们调查的算法方法来分类它们的可实现性,虽然基本的判定问题的可实现性检查是NP难的。作为应用,我们确定了8点三维构型、9点二维构型和9点五维构型的所有可能的组合类型(包括退化类型)。我们也可以确定所有可能的组合类型的5-多面体与9个顶点。

英文摘要:

Enumeration of all combinatorial types of point configurations and polytopes is a fundamental problem in combinatorial geometry. Although many studies have been done, most of them are for 2-dimensional and non-degenerate cases. Finschi and Fukuda (2001) published the first database of oriented matroids including degenerate (i.e. non-uniform) ones and of higher ranks. In this paper, we investigate algorithmic ways to classify them in terms of realizability, although the underlying decision problem of realizability checking is NP-hard. As an application, we determine all possible combinatorial types (including degenerate ones) of 3-dimensional configurations of 8 points, 2-dimensional configurations of 9 points and 5-dimensional configurations of 9 points. We could also determine all possible combinatorial types of 5-polytopes with 9 vertices.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑