Matthew Kwan

activity

20132023

most citedCycles and matchings in randomly perturbed digraphs and hypergraphs

49 citations · 158 across the 33 of their papers we have counts for

collaborators

Showing 2020Show all

6 papers · 1 filter

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

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 $P$ is…

math.CO2020

Dirac-type theorems in random hypergraphs

Asaf Ferber, Matthew Kwan

For positive integers $d < k$ and $n$ divisible by $k$ , let $m_{d} (k, n)$ be the minimum $d$ -degree ensuring the existence of a perfect matching in a $k$ -uniform hypergraph. In the gr…

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…