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

activity

20172026

most citedMajority Dynamics: The Power of One

3 citations · 6 across the 27 of their papers we have counts for

collaborators

Showing math.NTShow all

5 papers · 1 filter

math.NT2025

Bounds for monochromatic solutions to ${x + y, x y}$

Ben Green, Mehtaab Sawhney

Let $r$ be a sufficiently large positive integer, and let $N \geq exp exp (r^{50})$ . Then any $r$ -colouring of $[N]$ contains a monochromatic copy of ${x + y, x y}$ with $x > y > 2$ .

math.NT2025

On polynomial progressions via transference

Daniel Altman, Mehtaab Sawhney

We prove new cases of reasonable bounds for the polynomial Szemerédi theorem both over $Z / N Z$ with $N$ prime and over the integers. In particular, we prove reason…

math.NT2024

New bounds for the Furstenberg-Sárközy theorem

Ben Green, Mehtaab Sawhney

Suppose that $A \subset {1, \dots, N}$ has no two elements differing by a square. Then $∣ A ∣ ≪ N e^{- c l o g N}$ .

math.NT2024

Vinogradov's theorem for primes with restricted digits

James Leng, Mehtaab Sawhney

Let $g$ be sufficiently large, $b \in {0, \dots, g - 1}$ , and $S_{b}$ be the set of integers with no digit equal to $b$ in their base $g$ expansion. We prove that every suffic…

math.NT2022

Enumerating coprime permutations

Ashwin Sah, Mehtaab Sawhney

Define a permutation $σ$ to be coprime if $g cd (m, σ (m)) = 1$ for $m \in [n]$ . In this note, proving a recent conjecture of Pomerance, we prove that the number of coprime permutations…

Bounds for monochromatic solutions to {x+y,xy}

On polynomial progressions via transference

New bounds for the Furstenberg-Sárközy theorem

Vinogradov's theorem for primes with restricted digits

Enumerating coprime permutations

Bounds for monochromatic solutions to ${x + y, x y}$