166 citations · 655 across the 82 of their papers we have counts for
8 papers · 1 filter
The Erdős unit distance problem for small point sets
Boris Alexeev, Dustin G. Mixon, Hans Parshall
We improve the best known upper bound on the number of edges in a unit-distance graph on vertices for each . When , our bounds match the best kn…
Recovering a group from few orbits
Dustin G. Mixon, Brantley Vose
For an unknown finite group of automorphisms of a finite-dimensional Hilbert space, we find sharp bounds on the number of generic -orbits needed to recover up to group i…
More on the optimal arrangement of lines in
Joseph W. Iverson, John Jasper, Dustin G. Mixon
We introduce a new infinite family of equiangular tight frames. Many matrices in this family consist of two circulant blocks. We conjecture that such equia…
The nerd snipers problem
Boris Alexeev, Dustin G. Mixon
We correct errors that appear throughout "The vicious neighbour problem" by Tao and Wu. We seek to solve the following problem. Suppose nerds are distributed uniformly at rando…
Compact majority-minority districts almost never exist
Boris Alexeev, Dustin G. Mixon
For a uniformly distributed population, we show that with high probability, any majority-minority voting district containing a fraction of the population necessarily exhibits a tin…
Optimal codes in the Stiefel manifold
John Jasper, Nathan Mankovich, Dustin G. Mixon
We consider the coding problem in the Stiefel manifold with chordal distance. After considering various low-dimensional instances of this problem, we use Rankin's bounds on spheric…