collaborators

6 papers

math.CO2026

No--in-line problem for

Anubhab Ghosal, Ritesh Goenka, Alexandr Grebennikov +3

What is the maximum number of points one can place in an grid such that every Euclidean line contains at most points? For , this is the notorious no-three-i…

math.CO2026

Permanents of random matrices over finite fields

Zach Hunter, Matthew Kwan, Lisa Sauermann

Fix a finite field and let be a uniformly random matrix over . The asymptotic distribution of the determinant…

math.CO2025

Counting Perfect Matchings In Dirac Hypergraphs

Matthew Kwan, Roodabeh Safavi, Yiting Wang

One of the foundational theorems of extremal graph theory is Dirac's theorem, which says that if an n-vertex graph G has minimum degree at least n/2, then G has a Hamilton cycle, a…

math.PR2025

Exponential anticoncentration of the permanent

Zach Hunter, Matthew Kwan, Lisa Sauermann

Let be a random matrix with independent entries, and suppose that the entries are "uniformly anticoncentrated" in the sense that there is a constant $\…

math.CO2025

Geometric Littlewood-Offord problems via lattice point counting

Alexandr Grebennikov, Matthew Kwan

Consider nonzero vectors , independent Rademacher random variables , and a set . What upper bound…

math.CO2025

Algebraic aspects of the polynomial Littlewood-Offord problem

Zhihan Jin, Matthew Kwan, Lisa Sauermann +1

Consider a degree- polynomial of independent Rademacher random variables . To what extent can concentrate on a single…