The Convexity Conjecture, the Kahn-Kalai Conjecture, and introduction to k-thresholds

The "Convexity Conjecture" by Talagrand asks (very roughly) whether one can "create convexity" in constant steps regardless of the dimension of the ambient space. Talagrand also suggested a discrete version of the Convexity Conjecture and called it "my lifetime favorite problem," offering $1,000 prize for its solution. We introduce a reformulation of the discrete Convexity Conjecture using the new notion of "k-thresholds," which is an extension of the traditional notion of thresholds, introduced by Talagrand. Some ongoing work on understanding k-thresholds, along with a (vague) connection between the Kahn-Kalai Conjecture and the discrete Convexity Conjecture, will also be discussed. Joint work with Ascoli, He, and Talagrand.