The Subspace Flatness Conjecture and Faster Integer Programming

Learn about the Subspace Flatness Conjecture and its applications to accelerating integer programming algorithms in this 48-minute conference talk from BIMSA's ICBS2025 event. Explore advanced mathematical concepts connecting geometric flatness properties in subspaces to computational improvements in solving integer programming problems, gaining insights into cutting-edge research at the intersection of discrete optimization and geometric theory.