On the gamma-vector of symmetric edge polytopes
arXiv:2201.09835 · doi:10.1137/22M1492799
Abstract
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 nonnegativity of for any graph and completely characterize the case when . The latter also confirms a conjecture by Lutz and Nevo in the realm of symmetric edge polytopes. On the probabilistic side, we show that the -vectors of symmetric edge polytopes of most Erdős-Rényi random graphs are asymptotically almost surely nonnegative up to any fixed entry. This proves that Gal's conjecture holds asymptotically almost surely for arbitrary unimodular triangulations in this setting.
arXiv commentv2: 30 pages, 4 figures. To appear on SIAM Journal on Discrete Mathematics
References in corpus (14)
- Real Root Conjecture fails for five and higher dimensional spheres
- h-vectors of Gorenstein polytopes
- Vanishing theorems and conjectures for the, --homology of right-angled Coxeter groups
- On -vectors satisfying the Kruskal-Katona inequalities
- Arithmetic aspects of symmetric edge polytopes
- Centrally symmetric configurations of integer matrices
- Roots of Ehrhart polynomials arising from graphs
- Many faces of symmetric edge polytopes
- Smooth Fano polytopes arising from finite directed graphs
- Interlacing Ehrhart Polynomials of Reflexive Polytopes
- Fundamental polytopes of metric trees via parallel connections of matroids
- Symmetric edge polytopes and matching generating polynomials
- The -polynomials of locally anti-blocking lattice polytopes and their -positivity
- Directed acyclic decomposition of Kuramoto equations