On the cone of f-vectors of cubical polytopes

Ron M. Adin, Daniel Kalmanovich, Eran Nevo

Research output: Contribution to conferencePaperpeer-review

Abstract

What is the minimal closed cone containing all f-vectors of cubical d-polytopes? We construct cubical polytopes showing that this cone, expressed in the cubical g-vector coordinates, contains the nonnegative g-orthant, thus verifying one direction of the Cubical Generalized Lower Bound Conjecture of Babson, Billera and Chan. Our polytopes also show that a natural cubical analogue of the simplicial Generalized Lower Bound Theorem does not hold.

Original languageAmerican English
StatePublished - 2018
Event30th international conference on Formal Power Series and Algebraic Combinatorics, FPSAC 2018 - Hanover, United States
Duration: 16 Jul 201820 Jul 2018

Conference

Conference30th international conference on Formal Power Series and Algebraic Combinatorics, FPSAC 2018
Country/TerritoryUnited States
CityHanover
Period16/07/1820/07/18

Bibliographical note

Funding Information:
The authors thank Michael Joswig and Isabella Novik for helpful comments. The research of Adin was supported by an MIT-Israel MISTI grant. He also thanks the Israel Institute for Advanced Studies, Jerusalem, for its hospitality during part of the work on this paper. The research of Kalmanovich and Nevo was partially supported by Israel Science Foundation grant ISF-1695/15 and by grant 2528/16 of the ISF-NRF Singapore joint research program. This work was also partially supported by the National Science Foundation under Grant No. DMS-1440140, while Nevo was in residence at the Mathematical Sciences Research Institute in Berkeley, California, during the Fall 2017 semester.

Publisher Copyright:
© FPSAC 2018 - 30th international conference on Formal Power Series and Algebraic Combinatorics. All rights reserved.

Keywords

  • Cubical g-vector
  • Cubical polytope

Fingerprint

Dive into the research topics of 'On the cone of f-vectors of cubical polytopes'. Together they form a unique fingerprint.

Cite this