Facets and facet subgraphs of symmetric edge polytopes

Symmetric edge polytopes, a.k.a. PV-type adjacency polytopes, associated with undi-rected graphs have been defined and studied in several seemingly independent areas including number theory, discrete geometry, and dynamical systems. In particular, the authors are motivated by the study of the algebraic Kuramoto equations of unmixed form whose Newton polytopes are the symmetric edge polytopes.The interplay between the geometric structure of symmetric edge polytopes and the topological structure of the underlying graphs has been a recurring theme in recent studies. In particular, facet/face subgraphshave emerged as one of the central concepts in describing this symmetry. Continuing along this line of inquiry we provide a complete description of the correspondence between facets/faces of a symmetric edge polytope and maximal bipartite subgraphs of the underlying connected graph. (c) 2022 Elsevier B.V. All rights reserved.

Automated summary

Symmetric edge polytopes, also known as PV-type adjacency polytopes, associated with undirected graphs, have been defined and studied in multiple seemingly independent areas such as number theory, discrete geometry, and dynamical systems. The geometric structure of symmetric edge polytopes and the topological structure of the underlying graphs have been extensively studied and the correspondence between facets/faces of a symmetric edge polytope and maximal bipartite subgraphs of the underlying connected graph has been fully described.