2000 character limit reached
A note on Kalai's $3^d$ Conjecture
Published 16 Nov 2022 in math.CO and math.DG | (2211.09215v2)
Abstract: Suppose that $C$ is a centrally symmetric $d$-dimensional convex polytope; in 1989 Kalai conjectured that $C$ has at least $3d$ facets. We prove this result if there are $d$ hyperplanes with orthogonal normal vectors so that $C$ is symmetric about all of them.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.