From the 1 of 10 linked papers with an AI index.
14 citations · 26 across the 7 of their papers we have counts for
10 papers
Exponential improvements for superball packing upper bounds
Ashwin Sah, Mehtaab Sawhney, David Stoner +1
We prove that for all fixed , the translative packing density of unit -balls in is at most with . This is the first e…
Triforce and Corners
Jacob Fox, Ashwin Sah, Mehtaab Sawhney +2
May the be the 3-uniform hypergraph on six vertices with edges . We show that the minimum triforce density in a 3-uniform hypergraph of edge…
A reverse Sidorenko inequality
Ashwin Sah, Mehtaab Sawhney, David Stoner +1
Let be a graph allowing loops as well as vertex and edge weights. We prove that, for every triangle-free graph without isolated vertices, the weighted number of graph homom…
The number of independent sets in an irregular graph
Ashwin Sah, Mehtaab Sawhney, David Stoner +1
Settling Kahn's conjecture (2001), we prove the following upper bound on the number of independent sets in a graph without isolated vertices: \[ i(G) \le \prod_{uv \in E…
Hypercube Packings and Coverings with Higher Dimensional Rooks
Mehtaab Sawhney, David Stoner
The paper extends q‑ary codes by allowing points to cover others at Hamming distance 1 or 2 in chosen directions, and derives analogues of the sphere‑packing and Singleton bounds f…
Characters of Independent Stanley Sequences
Richard Moy, Mehtaab Sawhney, David Stoner
Odlyzko and Stanley introduced a greedy algorithm for constructing infinite sequences with no 3-term arithmetic progressions when beginning with a finite set with no 3-term arithme…