A Complexity Bound on Faces of the Hull Complex

Discrete & Computational Geometry(2004)

引用 5|浏览16
暂无评分
摘要
Given a monomial k[x 1 ,. . . ,x n ]-module M in the Laurent polynomial ring k[x 1 ±1 , . . . , x n ±1 ], the hull complex is defined to be the set of bounded faces of the convex hull of the points {t a | x a ∈ M} for sufficiently large t. Bayer and Sturmfels conjectured that the faces of this polyhedron are of bounded complexity in the sense that every such face is affinely isomorphic to a subpolytope of the (n – 1)-dimensional permutohedron, which in particular would imply that these faces have at most n! vertices. In this paper we prove that the latter statement is true, and give a counterexample to the stronger conjecture.
更多
查看译文
关键词
Computational Mathematic,Convex Hull,Polynomial Ring,Bounded Complexity,Laurent Polynomial Ring
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要