114 citations · 1k across the 63 of their papers we have counts for
5 papers · 1 filter
Sphere packing bounds via spherical codes
Henry Cohn, Yufei Zhao
The sphere packing problem asks for the greatest density of a packing of congruent balls in Euclidean space. The current best upper bound in all sufficiently high dimensions is due…
Energy-minimizing error-correcting codes
Henry Cohn, Yufei Zhao
We study a discrete model of repelling particles, and we show using linear programming bounds that many familiar families of error-correcting codes minimize a broad class of potent…
On replica symmetry of large deviations in random graphs
Eyal Lubetzky, Yufei Zhao
The following question is due to Chatterjee and Varadhan (2011). Fix and take , the Erdős-Rényi random graph with edge density , conditioned to have at l…
The critical window for the classical Ramsey-Turán problem
Jacob Fox, Po-Shen Loh, Yufei Zhao
The first application of Szemerédi's powerful regularity method was the following celebrated Ramsey-Turán result proved by Szemerédi in 1972: any K_4-free graph on N vertices with…
Extremal results in sparse pseudorandom graphs
David Conlon, Jacob Fox, Yufei Zhao
Szemerédi's regularity lemma is a fundamental tool in extremal combinatorics. However, the original version is only helpful in studying dense graphs. In the 1990s, Kohayakawa and R…