2000 character limit reached
Ehrhart theory of symmetric edge polytopes via ribbon structures (2201.10501v1)
Published 25 Jan 2022 in math.CO
Abstract: Using a ribbon structure of the graph, we construct a dissection of the symmetric edge polytope of a graph into unimodular simplices. Our dissection is shellable, and one can interpret the elements of the resulting $h$-vector via graph theory. This gives an elementary method for computing the $h*$-vector of the symmetric edge polytope.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.