Symmetric edge polytopes are a class of lattice polytopes constructed from finite simple
graphs. In the present paper we highlight their connections to the Kuramoto synchronization …

This article provides a comprehensive exposition about inequalities that the coefficients of
Ehrhart polynomials and h-polynomials satisfy under various assumptions. We pay …

We study-vectors associated with-vectors of symmetric edge polytopes both from a
deterministic and a probabilistic point of view. On the deterministic side, we prove …

Symmetric edge polytopes, aka PV-type adjacency polytopes, associated with undirected
graphs have been defined and studied in several seemingly independent areas including …

Starting from any finite simple graph, one can build a reflexive polytope known as a
symmetric edge polytope. The first goal of this paper is to show that symmetric edge …

A lattice polytope P ⊂ R^ d P⊂ R d is called a locally anti-blocking polytope if for any closed
orthant\mathbb R^ d_ ε R ε d in R^ d R d, P ∩ R^ d_ ε P∩ R ε d is unimodularly equivalent …

Polynomials which afford nonnegative, real‐rooted symmetric decompositions have been
investigated recently in algebraic, enumerative and geometric combinatorics. Brändén and …

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 …

Symmetric edge polytopes $\mathcal {A} _G $ of type A are lattice polytopes arising from the
root system $ A_n $ and finite simple graphs $ G $. There is a connection between …

We study the problem of maximum likelihood (ML) estimation for statistical models defined
by reflexive polytopes. Our focus is on the maximum likelihood degree of these models as …