1 citations · 1 across the 9 of their papers we have counts for
5 papers · 1 filter
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…
On the clustering behavior of sliding windows
Boris Alexeev, Wenyan Luo, Dustin G. Mixon +1
Things can go spectacularly wrong when clustering timeseries data that has been preprocessed with a sliding window. We highlight three surprising failures that emerge depending on…
Rewinding the byte trail of the White Whale
Boris Alexeev, Dustin G. Mixon
Motivated by a popular code golf challenge, we review some key ideas from information theory and discuss how to efficiently compress a streaming file with an acceptable error rate.