344 citations · 2.7k across the 49 of their papers we have counts for
Showing 2001Show all
3 papers · 1 filter
math.MG2001★ 101 cited
New upper bounds on sphere packings II
Henry Cohn
We continue the study of the linear programming bounds for sphere packing introduced by Cohn and Elkies. We use theta series to give another proof of the principal theorem, and pre…
math.MG2001★ 311 cited
New upper bounds on sphere packings I
Henry Cohn, Noam Elkies
We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which ar…
math.PR2001
Generating a random sink-free orientation in quadratic time
Henry Cohn, Robin Pemantle, James Propp
A sink-free orientation of a finite undirected graph is a choice of orientation for each edge such that every vertex has out-degree at least 1. Bubley and Dyer (1997) use Markov Ch…