This article is cited in 14 papers

Sharp upper and lower bounds for nestohedra

V. M. Buchstaber^a, V. D. Volodin<sup>b

a</sup> Steklov Mathematical Institute, Russian Academy of Sciences
^b M. V. Lomonosov Moscow State University

Abstract: We obtain sharp upper and lower bounds for the coefficients of the enumerative polynomials of all flag nestohedra as well as for certain important subclasses including graph-associahedra. Proofs are based on an original construction of sequences of polytopes.

Keywords: convex polytope, face vector, flag nestohedron, graph-associahedron, Gal's conjecture.

UDC: 515.164.8

MSC: 05E45, 14M25, 52B05

Received: 17.08.2010
Revised: 09.03.2011

DOI: 10.4213/im4732

 English version: Izvestiya: Mathematics, 2011, 75:6, 1107–1133

Bibliographic databases:

• 
• 
• 
• 
• 
• 
•