Proof of Gal's conjecture for theDseries of generalized associahedra

DOI10.1070/RM2010V065N06ABEH004719MaRDI QIDQ2996217zbMATH OpenOpenAlexWikidataFDO

Authors M. A. Gorsky

Publication date 6 May 2011

Published in Russian Mathematical Surveys (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1106.1840

zbMATH Keywords

Coxeter-Dynkin diagramflag polytopeGal's conjecturegeneralized associahedron

Mathematics Subject Classification ID

Cluster algebras (13F60) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05)

Abstract: In this short note we consider generalized associahedra of type D_n. We prove that these simple flag polytopes are not nestohedra for n > 3, but the statement of Gal's conjecture holds for them.

Recommendations

• Cubical realizations of flag nestohedra and proof of Gal's conjecture for them
• Gal's conjecture for nestohedra corresponding to complete bipartite graphs
• Geometric realization of the \( \gamma\)-vectors of 2-truncated cubes
• Sharp upper and lower bounds for nestohedra
• The flag polynomial of the Minkowski sum of simplices
• A type-B associahedron.
• Ring of simple polytopes and differential equations
• scientific article; zbMATH DE number 1538122
• Faces of generalized permutohedra
• Three theorems, with computer-aided proofs, on three-dimensional faces and quotients of polytopes

Cited in

(6)

• Gamma-positivity in combinatorics and geometry
• Induced equators in flag spheres
• Cubical realizations of flag nestohedra and proof of Gal's conjecture for them
• Inequalities between gamma-polynomials of graph-associahedra
• Geometric realization of the \( \gamma\)-vectors of 2-truncated cubes
• Combinatorial 2-truncated cubes and applications

This page was built for publication: Proof of Gal's conjecture for theDseries of generalized associahedra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2996217)