|
This article is cited in 13 scientific papers (total in 14 papers)
Sharp upper and lower bounds for nestohedra
V. M. Buchstabera, V. D. Volodinb a 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.
Received: 17.08.2010 Revised: 09.03.2011
Citation:
V. M. Buchstaber, V. D. Volodin, “Sharp upper and lower bounds for nestohedra”, Izv. Math., 75:6 (2011), 1107–1133
Linking options:
https://www.mathnet.ru/eng/im4732https://doi.org/10.1070/IM2011v075n06ABEH002566 https://www.mathnet.ru/eng/im/v75/i6/p17
|
Statistics & downloads: |
Abstract page: | 873 | Russian version PDF: | 275 | English version PDF: | 40 | References: | 92 | First page: | 25 |
|