Mehtaab Sawhney · wovepaper

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 88 linked papers with an AI index.

activity

20172026

most citedEarly science acceleration experiments with GPT-5

3 citations · 17 across the 56 of their papers we have counts for

collaborators

Showing 2020Show all

14 papers · 1 filter

Paths of given length in tournaments

Ashwin Sah, Mehtaab Sawhney, Yufei Zhao

We prove that every $n$ -vertex tournament has at most $n (\frac{n - 1}{2})^{k}$ walks of length $k$ .

Optimal and algorithmic norm regularization of random matrices

Vishesh Jain, Ashwin Sah, Mehtaab Sawhney

Let $A$ be an $n \times n$ random matrix whose entries are i.i.d. with mean $0$ and variance $1$ . We present a deterministic polynomial time algorithm which, with probability at lea…

On the smallest singular value of symmetric random matrices

Vishesh Jain, Ashwin Sah, Mehtaab Sawhney

We show that for an $n \times n$ random symmetric matrix $A_{n}$ , whose entries on and above the diagonal are independent copies of a sub-Gaussian random variable $ξ$ with mean $0$ an…

Singularity of discrete random matrices

Vishesh Jain, Ashwin Sah, Mehtaab Sawhney

Let $ξ$ be a non-constant real-valued random variable with finite support, and let $M_{n} (ξ)$ denote an $n \times n$ random matrix with entries that are independent copies of $ξ$ . F…

Sharp invertibility of random Bernoulli matrices

Vishesh Jain, Ashwin Sah, Mehtaab Sawhney

Let $p \in (0, 1/2)$ be fixed, and let $B_{n} (p)$ be an $n \times n$ random matrix with i.i.d. Bernoulli random variables with mean $p$ . We show that for all $t \geq 0$ , \[\mathbb{P}[s_…

On the smoothed analysis of the smallest singular value with discrete noise

Vishesh Jain, Ashwin Sah, Mehtaab Sawhney

Let $A$ be an $n \times n$ real matrix, and let $M$ be an $n \times n$ random matrix whose entries are i.i.d sub-Gaussian random variables with mean $0$ and variance $1$ . We make two…