7 citations · 7 across the 5 of their papers we have counts for
4 papers · 1 filter
Globally optimizing small codes in real projective spaces
Dustin G. Mixon, Hans Parshall
For , we classify arrangements of points in for which the minimum distance is as large as possible. To do so, we leverage ideas from matrix…
The optimal packing of eight points in the real projective plane
Dustin G. Mixon, Hans Parshall
How can we arrange lines through the origin in three-dimensional Euclidean space in a way that maximizes the minimum interior angle between pairs of lines? Conway, Hardin and S…
A Delsarte-Style Proof of the Bukh-Cox Bound
Mark Magsino, Dustin G. Mixon, Hans Parshall
The line packing problem is concerned with the optimal packing of points in real or complex projective space so that the minimum distance between points is maximized. Until recentl…
Exact Line Packings from Numerical Solutions
Dustin G. Mixon, Hans Parshall
Recent progress in Zauner's conjecture has leveraged deep conjectures in algebraic number theory to promote numerical line packings to exact and verifiable solutions to the line pa…