Gorenstein polytopes obtained from bipartite graphs (Q2380440)

The author investigates the problem of Gorenstein polygons. For a lattice polygon \(P\) consider its Ehrhart series and take the polynomial in its numerator. The polygon \(P\) is Gorenstein if all the coefficients of the considered polynomial are symmetric (with respect to the degree of polynomial). The actual question is: Which polytopes are Gorenstein? The author studies cases of special polytopes that are constructed with respect to the adjacency relations of certain graphs. Beck et al. characterized the grid graphs whose perfect matching polytopes are Gorenstein and they also showed that for some parameters, perfect matching polytopes of torus graphs are Gorenstein. In this paper, the author closes the problem for the case of grid graphs. Beck et al. also gave a method to construct an infinite family of Gorenstein polytopes. In this paper, the author introduces a new class of polytopes obtained from graphs and extends his method to construct many other Gorenstein polytopes.