Matthew Kwan

activity

20182021

collaborators

16 papers

math.CO2021

Note on random Latin squares and the triangle removal process

Matthew Kwan, Ashwin Sah, Mehtaab Sawhney

This is a companion note to the paper "Almost all Steiner triple systems have perfect matchings (arXiv:1611.02246). That paper contains several general lemmas about random Steiner…

math.CO2021

Friendly bisections of random graphs

Asaf Ferber, Matthew Kwan, Bhargav Narayanan +2

Resolving a conjecture of Füredi from 1988, we prove that with high probability, the random graph $G (n, 1/2)$ admits a friendly bisection of its vertex set, i.e., a partition of its…

cs.IT2020

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…

math.CO2020

Singularity of sparse random matrices: simple proofs

Asaf Ferber, Matthew Kwan, Lisa Sauermann

Consider a random $n \times n$ zero-one matrix with "density" $p$ , sampled according to one of the following two models: either every entry is independently taken to be one with pro…

math.PR2020

On the permanent of a random symmetric matrix

Matthew Kwan, Lisa Sauermann

Let $M_{n}$ denote a random symmetric $n \times n$ matrix, whose entries on and above the diagonal are i.i.d. Rademacher random variables (taking values $\pm 1$ with probability $1/…

math.CO2020

Lower bounds for superpatterns and universal sequences

Zachary Chroman, Matthew Kwan, Mihir Singhal

A permutation $σ \in S_{n}$ is said to be $k$ -universal or a $k$ -superpattern if for every $π \in S_{k}$ , there is a subsequence of $σ$ that is order-isomorphic to $π$ . A simple counting…