Papers
Topics
Authors
Recent
Search
2000 character limit reached

Ehrhart theory of symmetric edge polytopes via ribbon structures

Published 25 Jan 2022 in math.CO | (2201.10501v1)

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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.