166 citations · 655 across the 82 of their papers we have counts for
10 papers · 1 filter
BalLOT: Balanced -means clustering with optimal transport
Wenyan Luo, Dustin G. Mixon
We consider the fundamental problem of balanced -means clustering. In particular, we introduce an optimal transport approach to alternating minimization called BalLOT, and we sh…
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…
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, P…
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…
Asymmetric SICs over finite fields
Joseph W. Iverson, Dustin G. Mixon
Zauner's conjecture concerns the existence of equiangular lines in ; such a system of lines is known as a SIC. In this paper, we construct infinitely many new S…
Estimating the Euclidean distortion of an orbit space
Ben Blum-Smith, Harm Derksen, Dustin G. Mixon +2
Given a finite-dimensional inner product space and a group of isometries, we consider the problem of embedding the orbit space into a Hilbert space in a way that pres…