Gorenstein polytopes obtained from bipartite graphs

MaRDI QIDQ2380440zbMATH OpenFDO

Authors Makoto Tagami

Publication date 26 March 2010

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0803.1033, https://eudml.org/doc/227198, http://www.emis.de/journals/EJC/Volume_17/Abstracts/v17i1r8.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

bi-partite graphsGorenstein polytopesperfect matching polytopestorus graphs

Mathematics Subject Classification ID

Graph theory (05C99) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Cellular automata (computational aspects) (68Q80)

Abstract: 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, we complement their result, that is, we characterize the torus graphs whose perfect matching polytopes are Gorenstein. Beck et. al. also gave a method to construct an infinite family of Gorenstein polytopes. In this paper, we introduce a new class of polytopes obtained from graphs and we extend their method to construct many more Gorenstein polytopes.

Review text

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.

Recommendations

• Gorenstein cut polytopes
• Grid graphs, Gorenstein polytopes, and domino stackings
• Gorenstein polytopes with trinomial \(h^*\)-polynomials
• On the Gorenstein property of the Ehrhart ring of the stable set polytope of an h-perfect graph
• Reflexive polytopes arising from perfect graphs

Cited in

(13)

• Gorenstein polytopes and their stringy \(E\)-functions
• Gorenstein polytopes with trinomial \(h^*\)-polynomials
• Gorenstein graphic matroids from multigraphs
• Unconditional reflexive polytopes
• Special simplices and Gorenstein toric rings.
• Matrices defining Gorenstein lattice ideals
• Gorenstein cut polytopes
• On the Gorenstein property of the Ehrhart ring of the stable set polytope of an h-perfect graph
• Toric rings of perfectly matchable subgraph polytopes
• Non-Gorenstein locus and almost Gorenstein property of the Ehrhart ring of the stable set polytope of a cycle graph
• Nearly Gorenstein polytopes
• Gorenstein Matroids
• Grid graphs, Gorenstein polytopes, and domino stackings

This page was built for publication: Gorenstein polytopes obtained from bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380440)