43 citations · 135 across the 14 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
math.OC2013★ 29 cited
A semidefinite programming hierarchy for packing problems in discrete geometry
David de Laat, Frank Vallentin
Packing problems in discrete geometry can be modeled as finding independent sets in infinite graphs where one is interested in independent sets which are as large as possible. For…
math.OC2013★ 2 cited
Fourier analysis on finite groups and the Lovász theta-number of Cayley graphs
Evan DeCorte, David de Laat, Frank Vallentin
We apply Fourier analysis on finite groups to obtain simplified formulations for the Lovász theta-number of a Cayley graph. We put these formulations to use by checking a few cases…