Mathematics > Combinatorics
[Submitted on 8 May 2018 (v1), last revised 9 Jan 2019 (this version, v2)]
Title:QGLBT for polytopes
View PDFAbstract:We extend the assertion of the Generalized Lower Bound Theorem (GLBT) to general polytopes under the assumption that their low dimensional skeleton is simplicial, with partial results for the general case. We prove a quantitative version of the GLBT for general polytopes, and use it to give a topological necessary condition for polytopes to have vanishing toric $g_k$ entry. As another application of the QGLBT we prove a conjecture of Kalai on $g$-numbers for general polytopes approximating a smooth convex body.
Submission history
From: Karim Alexander Adiprasito [view email][v1] Tue, 8 May 2018 20:26:36 UTC (11 KB)
[v2] Wed, 9 Jan 2019 15:15:05 UTC (10 KB)
Current browse context:
math.CO
References & Citations
Bookmark
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.