13 citations · 53 across the 33 of their papers we have counts for
5 papers · 1 filter
List-decodability with large radius for Reed-Solomon codes
Asaf Ferber, Matthew Kwan, Lisa Sauermann
List-decodability of Reed-Solomon codes has received a lot of attention, but the best-possible dependence between the parameters is still not well-understood. In this work, we focu…
Singularity of sparse random matrices: simple proofs
Asaf Ferber, Matthew Kwan, Lisa Sauermann
Consider a random zero-one matrix with "density" , sampled according to one of the following two models: either every entry is independently taken to be one with pro…
On the permanent of a random symmetric matrix
Matthew Kwan, Lisa Sauermann
Let denote a random symmetric matrix, whose entries on and above the diagonal are i.i.d. Rademacher random variables (taking values with probability $1/…
Polynomials that vanish to high order on most of the hypercube
Lisa Sauermann, Yuval Wigderson
Motivated by higher vanishing multiplicity generalizations of Alon's Combinatorial Nullstellensatz and its applications, we study the following problem: for fixed and …
Extension complexity of low-dimensional polytopes
Matthew Kwan, Lisa Sauermann, Yufei Zhao
Sometimes, it is possible to represent a complicated polytope as a projection of a much simpler polytope. To quantify this phenomenon, the extension complexity of a polytope is…