Numerical nonlinear algebra is a computational paradigm that uses numerical analysis to
study polynomial equations. Its origins were methods to solve systems of polynomial …

An independence model for discrete random variables is a Segre-Veronese variety in a
probability simplex. Any metric on the set of joint states of the random variables induces a …

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 …

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 …

The goal of this paper is to study geometric and extremal properties of the convex body BF
(M), which is the unit ball of the Lipschitz-free Banach space associated with a finite metric …

Symmetric edge polytopes, also called adjacency polytopes, are lattice polytopes
determined by simple undirected graphs. We introduce the integer array\(\mathrm {maxf}(n …