Ohsugi–Tsuchiya gamma-nonnegativity conjecture for symmetric edge polytopes
Ohsugi–Tsuchiya gamma-nonnegativity conjecture for symmetric edge polytopes
Let be a graph, and let be its symmetric edge polytope. Write for the -vector associated with the palindromic -vector of .
Ohsugi–Tsuchiya conjecture. For every ,
This conjecture extends gamma-nonnegativity from flag simplicial spheres to symmetric edge polytopes, whose relevant triangulations need not be flag. The supplied status evidence says that this instance was proved in the original work of Hibi, Matsuda, and Murai and generalized by Ohsugi and Tsuchiya to the indicated bipartite-graph setting; it is therefore solved.
Equivalent formulations 1
Other statements of this same problem, merged from separate entries. Each is equivalent to the statement above — proving any one settles them all.
Ohsugi–Tsuchiya gamma-nonnegativity conjecture for symmetric edge polytopes
Let be a graph, let be its symmetric edge polytope, and write its -polynomial in the palindromic basis as , where . The associated -polynomial is . Ohsugi–Tsuchiya's conjecture. The polynomial has nonnegative coefficients for every graph . This conjecture concerns coefficient inequalities in the Ehrhart theory of symmetric edge polytopes; the supplied text gives no resolution status.
source: Giulia Codenotti, Roberto Riccardi and Lorenzo Venturello, “The number of edges of a symmetric edge polytope”, arXiv:2512.16572 (2026).
Sources & referencesView supporting material
Primary source
Alessio D'Alì, Martina Juhnke-Kubitzke, Daniel Köhne and Lorenzo Venturello, “On the gamma-vector of symmetric edge polytopes”, arXiv:2201.09835 (2022).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.