Kalai's 3^d conjecture
Maths conjecture / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Kalai's 3^d conjecture?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
In geometry, Kalai's 3d conjecture is a conjecture on the polyhedral combinatorics of centrally symmetric polytopes, made by Gil Kalai in 1989.[1] It states that every d-dimensional centrally symmetric polytope has at least 3d nonempty faces (including the polytope itself as a face but not including the empty set).
Unsolved problem in mathematics:
Does every -dimensional centrally symmetric polytope have at least nonempty faces?