From the 1 of 90 linked papers with an AI index.
14 citations · 74 across the 75 of their papers we have counts for
12 papers · 1 filter
The existence of subspace designs
Peter Keevash, Ashwin Sah, Mehtaab Sawhney
We prove the existence of subspace designs with any given parameters, provided that the dimension of the underlying space is sufficiently large in terms of the other parameters of…
A Toolkit for Robust Thresholds
Huy Tuan Pham, Ashwin Sah, Mehtaab Sawhney +1
Consider a host hypergraph which contains a spanning structure due to minimum degree considerations. We collect three results proving that if the edges of are sampled at th…
Subgraph distributions in dense random regular graphs
Ashwin Sah, Mehtaab Sawhney
Given connected graph which is not a star, we show that the number of copies of in a dense uniformly random regular graph is asymptotically Gaussian, which was not known ev…
Anticoncentration in Ramsey graphs and a proof of the Erdős-McKay conjecture
Matthew Kwan, Ashwin Sah, Lisa Sauermann +1
An -vertex graph is called -Ramsey if it has no clique or independent set of size (i.e., if it has near-optimal Ramsey behavior). In this paper, we study edge-sta…
Cayley graphs that have a quantum ergodic eigenbasis
Assaf Naor, Ashwin Sah, Mehtaab Sawhney +1
We investigate which finite Cayley graphs admit a quantum ergodic eigenbasis, proving that this holds for any Cayley graph on a group of size for which the sum of the dimension…
Spencer's theorem in nearly input-sparsity time
Vishesh Jain, Ashwin Sah, Mehtaab Sawhney
A celebrated theorem of Spencer states that for every set system , there is a coloring of the ground set with with discrepancy $O(\sqrt{n\…