12 citations · 12 across the 11 of their papers we have counts for
8 papers · 1 filter
Short spherical -design curves
Emily J. King, Dustin G. Mixon
We study the minimum arclength of spherical -design curves, i.e., closed rectifiable curves on whose normalized arclength measure exactly integrates every polynomial of de…
Totally symmetric Grassmannian codes
Matthew Fickus, Joseph W. Iverson, John Jasper +1
We introduce a general technique to construct tight fusion frames with prescribed symmetries. Applying this technique with a prescription for "all the symmetries", we construct a n…
Forbidden Sidon subsets of perfect difference sets, featuring a human-assisted proof
Boris Alexeev, Dustin G. Mixon
We resolve a $1000 ErdÅs prize problem, complete with formal verification generated by a large language model. In over a dozen papers, beginning in 1976 and spanning two decades,…
Uniquely optimal codes of low complexity are symmetric
Emily J. King, Dustin G. Mixon, Hans Parshall +1
We formulate explicit predictions concerning the symmetry of optimal codes in compact metric spaces. This motivates the study of optimal codes in various spaces where these predict…
Asymptotically optimal approximate Hadamard matrices
Boris Alexeev, John Jasper, Dustin G. Mixon
An approximate Hadamard matrix is a well-conditioned square matrix with all entries in . We measure the quality of a matrix by its condition number, i.e., the ratio of it…
The independence and clique cover numbers of the squarefree graph
Boris Alexeev, Dustin G. Mixon, Will Sawin
We determine the largest subset such that for all , the product is not squarefree. Specifically, the maximum size is achieved by the comp…