Watch a 57-minute mathematics lecture exploring a groundbreaking proof of the reverse Minkowski theorem, originally conjectured by Daniel Dadush. Delve into how lattices with numerous short points must contain sublattices with small determinants, effectively establishing a converse to Minkowski's first theorem - a cornerstone result in the geometry of numbers. Learn about the theorem's wide-ranging applications across complexity theory, additive combinatorics, cryptography, Brownian motion on flat tori, and lattice problem algorithms. Discover how this mathematical breakthrough recently enabled Reis and Rothvoss to achieve the first significant advancement in integer programming in nearly four decades. The lecture, presented at the Hausdorff Center for Mathematics, is based on joint work with Oded Regev.