Gal's conjecture for nestohedra corresponding to complete bipartite graphs

DOI10.1134/S0081543809030079zbMath1227.52006OpenAlexW2108162115WikidataQ123267675 ScholiaQ123267675MaRDI QIDQ1048449

Nikolai Erokhovets

Publication date: 12 January 2010

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0081543809030079

zbMATH Keywords

convex polytopesconnected building set

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Structural characterization of families of graphs (05C75)

Related Items

Truncations of simple polytopes and applications, Frankl-Füredi-Kalai inequalities on the \(\gamma\)-vectors of flag nestohedra, Buchstaber invariant theory of simplicial complexes and convex polytopes, Diameter estimates for graph associahedra

Cites Work

• Unnamed Item
• Unnamed Item
• Ring of simple polytopes and differential equations
• Nested complexes and their polyhedral realizations
• Faces of generalized permutohedra
• The number of faces of a simplicial convex polytope
• A proof of the sufficiency of McMullen's conditions for f-vectors of simplicial convex polytopes
• Vanishing theorems and conjectures for the 2-homology of right-angled Coxeter groups
• The numbers of faces of simplicial polytopes
• Real root conjecture fails for five- and higher-dimensional spheres