Mehtaab Sawhney

works on

coding theory 1 covering codes 1 packing bounds 1 q-ary codes 1 singleton bound 1 sphere-packing bound 1

From the 1 of 90 linked papers with an AI index.

activity

20152026

most citedThe number of independent sets in an irregular graph

14 citations · 74 across the 75 of their papers we have counts for

collaborators

Showing 2023Show all

8 papers · 1 filter

math.NT2023

Improved bounds for five-term arithmetic progressions

James Leng, Ashwin Sah, Mehtaab Sawhney

Let $r_{5} (N)$ be the largest cardinality of a set in ${1, \dots, N}$ which does not contain $5$ elements in arithmetic progression. Then there exists a constant $c \in (0, 1)$ such t…

math.PR2023

The limiting spectral law for sparse iid matrices

Ashwin Sah, Julian Sahasrabudhe, Mehtaab Sawhney

Let $A$ be an $n \times n$ matrix with iid entries where $A_{ij} \sim Ber (p)$ is a Bernoulli random variable with parameter $p = d / n$ . We show that the empirical measure of…

math.PR2023

The sparse circular law, revisited

Ashwin Sah, Julian Sahasrabudhe, Mehtaab Sawhney

Let $A_{n}$ be an $n \times n$ matrix with iid entries distributed as Bernoulli random variables with parameter $p = p_{n}$ . Rudelson and Tikhomirov, in a beautiful and celebrated paper…

math.NT2023★ 2 cited

Effective bounds for Roth's theorem with shifted square common difference

Sarah Peluse, Ashwin Sah, Mehtaab Sawhney

Let $S$ be a subset of ${1, \dots, N}$ avoiding the nontrivial progressions $x, x + y^{2} - 1, x + 2 (y^{2} - 1)$ . We prove that $∣ S ∣ ≪ N / lo g_{m} N$ , where $lo g_{m}$ is the $m$ -fold iterated…

math.PR2023

On Perfectly Friendly Bisections of Random Graphs

Dor Minzer, Ashwin Sah, Mehtaab Sawhney

We prove that there exists a constant $γ_{crit} \approx .17566$ such that if $G \sim G (n, 1/2)$ then for any $ε > 0$ with high probability $G$ has a equipa…

math.CO2023

The Exact Rank of Sparse Random Graphs

Margalit Glasgow, Matthew Kwan, Ashwin Sah +1

Two landmark results in combinatorial random matrix theory, due to Komlós and Costello-Tao-Vu, show that discrete random matrices and symmetric discrete random matrices are typical…