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 2019Show all

4 papers · 1 filter

math.CO2019

Bounded Degree Spanners of the Hypercube

Rajko Nenadov, Mehtaab Sawhney, Benny Sudakov +1

In this short note we study two questions about the existence of subgraphs of the hypercube $Q_{n}$ with certain properties. The first question, due to Erdős--Hamburger--Pippert--Wea…

math.CO2019★ 2 cited

Number of arithmetic progressions in dense random subsets of $Z / n Z$

Ross Berkowitz, Ashwin Sah, Mehtaab Sawhney

We examine the behavior of the number of $k$ -term arithmetic progressions in a random subset of $Z / n Z$ . We prove that if a set is chosen by including each element…

math.MG2019★ 3 cited

Exponential improvements for superball packing upper bounds

Ashwin Sah, Mehtaab Sawhney, David Stoner +1

We prove that for all fixed $p > 2$ , the translative packing density of unit $ℓ_{p}$ -balls in $R^{n}$ is at most $2^{(γ_{p} + o (1)) n}$ with $γ_{p} < - 1/ p$ . This is the first e…

math.CO2019★ 6 cited

Triforce and Corners

Jacob Fox, Ashwin Sah, Mehtaab Sawhney +2

May the $triforce$ be the 3-uniform hypergraph on six vertices with edges ${12 3^{'}, 1 2^{'} 3, 1^{'} 23}$ . We show that the minimum triforce density in a 3-uniform hypergraph of edge…

Bounded Degree Spanners of the Hypercube

Number of arithmetic progressions in dense random subsets of Z/nZ

Exponential improvements for superball packing upper bounds

Triforce and Corners

Number of arithmetic progressions in dense random subsets of $Z / n Z$