Sharp upper and lower bounds for nestohedra
Izvestiya. Mathematics , Tome 75 (2011) no. 6, pp. 1107-1133
Voir la notice de l'article provenant de la source Math-Net.Ru
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
Mots-clés : graph-associahedron, Gal's conjecture.
Mots-clés : graph-associahedron, Gal's conjecture.
@article{IM2_2011_75_6_a1,
author = {V. M. Buchstaber and V. D. Volodin},
title = {Sharp upper and lower bounds for nestohedra},
journal = {Izvestiya. Mathematics },
pages = {1107--1133},
publisher = {mathdoc},
volume = {75},
number = {6},
year = {2011},
language = {en},
url = {http://geodesic.mathdoc.fr/item/IM2_2011_75_6_a1/}
}
V. M. Buchstaber; V. D. Volodin. Sharp upper and lower bounds for nestohedra. Izvestiya. Mathematics , Tome 75 (2011) no. 6, pp. 1107-1133. http://geodesic.mathdoc.fr/item/IM2_2011_75_6_a1/