A fundamental math shape was just proven to be way more 'connected' than anyone thought, solving a long-standing mystery in geometry.
April 15, 2026
Original Paper
Random 0/1-polytopes expand rapidly
arXiv · 2604.09520
The Takeaway
In the world of abstract geometry, 0/1-polytopes are used to solve everything from shipping routes to computer logic. For years, mathematicians have conjectured about how many 'edges' you need to travel to get from one corner to another. This paper proves that these shapes expand 'rapidly' as they get more complex—far faster than the 'constant' rate that was previously suspected. This isn't just for math nerds; it significantly improves the 'algorithms' we use for optimization. It means we can now solve massive, complex logistical problems—like the global supply chain—much more efficiently than before because we finally understand the 'shortcuts' hidden in the math.
From the abstract
A 0/1-polytope is the convex hull of a subset $V\subseteq \{0,1\}^n$. A celebrated conjecture of Mihail and Vazirani asserts that the graph of every 0/1-polytope has edge-expansion at least 1. In this paper, we show that typical 0/1-polytopes have significantly stronger expansion. Specifically, if $V$ is formed by sampling each vertex of $\{0,1\}^n$ independently with constant probability $p$, then with high probability the edge-expansion is $\Theta(n)$ for $p \in (1/2, 1)$, and $n^{\Theta(\log