Abstract
In this paper, we introduce polytopes arising from root systems and finite graphs , and study their combinatorial and algebraic properties. In particular, it is shown that is reflexive if and only if is bipartite. Moreover, in the case, has a regular unimodular triangulation. This implies that the -polynomial of is palindromic and unimodal when is bipartite. Furthermore, we discuss stronger properties, namely the -positivity and the real-rootedness of the -polynomials. In fact, if is bipartite, then the -polynomial of is -positive and its -polynomial is given by an interior polynomial (a version of the Tutte polynomial for a hypergraph). The -polynomial is real-rooted if and only if the corresponding interior polynomial is real-rooted. From a counterexample to Neggers--Stanley conjecture, we construct a bipartite graph whose -polynomial is not real-rooted but -positive, and coincides with the -polynomial of a flag triangulation of a sphere.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.