• Corpus ID: 246240433

On the gamma-vector of symmetric edge polytopes

  title={On the gamma-vector of symmetric edge polytopes},
  author={Alessio D'Al{\`i} and Martina Juhnke-Kubitzke and Daniel Kohne and Lorenzo Venturello},
We study γ-vectors associated with h-vectors of symmetric edge polytopes both from a deterministic and a probabilistic point of view. On the deterministic side, we prove nonnegativity of γ2 for any graph and completely characterize the case when γ2 = 0. 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… 

Figures from this paper

Facets of Random Symmetric Edge Polytopes, Degree Sequences, and Clustering

This work uses well-known Markov Chain Monte Carlo sampling methods to generate empirical evidence that for a fixed degree sequence, higher WattsStrogatz clustering in a connected graph corresponds to higher facet numbers in the associated symmetric edge polytope.

Facets of Symmetric Edge Polytopes for Graphs with Few Edges

. Symmetric edge polytopes, also called adjacency polytopes, are lattice polytopes determined by simple undirected graphs. In this paper we study the number of facets of symmetric edge polytopes for

Normalized Volumes of Type-PQ Adjacency Polytopes for Certain Classes of Graphs

Abstract. The type-PQ adjacency polytope associated to a simple graph is a 0/1-polytope containing valuable information about an underlying power network. Chen and the first author have recently

Faces of Cosmological Polytopes

. A cosmological polytope is a lattice polytope introduced by Arkani-Hamed, Benincasa, and Post- nikov in their study of the wavefunction of the universe in a class of cosmological models. More

Ehrhart theory of symmetric edge polytopes via ribbon structures

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 interpret the elements



h-Vectors of Gorenstein polytopes

Facets and facet subgraphs of adjacency polytopes

Adjacency polytopes, a.k.a. symmetric edge polytopes, associated with undirected graphs have been defined and studied in several seemingly-independent areas including number theory, discrete

Gamma-positivity in combinatorics and geometry

Gamma-positivity is an elementary property that polynomials with symmetric coefficients may have, which directly implies their unimodality. The idea behind it stems from work of Foata,

Geometric Realization of γ-Vectors of Subdivided Cross Polytopes

For any flag simplicial complex obtained by stellar subdividing the boundary of the cross polytope in edges, it is proved that the γ-vector of any such simplicialcomplex is the face vector of a flag simplified complex, partially solving a conjecture by Nevo and Petersen.

Smooth Fano polytopes arising from finite directed graphs

In this paper, we consider terminal reflexive polytopes arising from finite directed graphs and study the problem of deciding which directed graphs yield smooth Fano polytopes. We show that any

Flag subdivisions and γ-vectors

The -vector is an important enumerative invariant of a flag simplicial homology sphere. It has been conjectured by Gal that this vector is nonnegative for every such sphere 1 and by Reiner, Postnikov

On γ-Vectors Satisfying the Kruskal–Katona Inequalities

It is conjectured that if Δ is a flag homology sphere then γ(Δ) satisfies the Kruskal–Katona, and further, the Frankl–Füredi–Kalai inequalities, which is a significant refinement of Gal’s conjecture, which asserts that such γ-vectors are nonnegative.

Roots of Ehrhart polynomials arising from graphs

Several polytopes arise from finite graphs. For edge and symmetric edge polytopes, in particular, exhaustive computation of the Ehrhart polynomials not merely supports the conjecture of Beck et al.

Domination numbers and homology