The following pages link to Mehtaab Sawhney (Q724878):
Displaying 50 items.
- On the discrepancy between two Zagreb indices (Q724879) (← links)
- A reverse Sidorenko inequality (Q785934) (← links)
- On a conjecture regarding permutations which destroy arithmetic progressions (Q1640216) (← links)
- Characters of independent Stanley sequences (Q1746590) (← links)
- Properties of non-symmetric Macdonald polynomials at \(q=1\) and \(q=0\) (Q2003723) (← links)
- Number of arithmetic progressions in dense random subsets of \(\mathbb{Z}/n\mathbb{Z}\) (Q2055283) (← links)
- On the real Davies' conjecture (Q2072087) (← links)
- Rank deficiency of random matrices (Q2113279) (← links)
- Singularity of discrete random matrices (Q2126277) (← links)
- Exponential improvements for superball packing upper bounds (Q2308311) (← links)
- The number of independent sets in an irregular graph (Q2312617) (← links)
- Two classes of modular \(p\)-Stanley sequences (Q2335910) (← links)
- A major-index preserving map on fillings (Q2409835) (← links)
- Enumerating matroids and linear spaces (Q2683212) (← links)
- The cylindrical width of transitive sets (Q2698437) (← links)
- Hypercube Packings and Coverings with Higher Dimensional Rooks (Q3300685) (← links)
- Patterns without a popular difference (Q3382243) (← links)
- On Symmetric But Not Cyclotomic Numerical Semigroups (Q4568065) (← links)
- A Telescoping Proof of the AM–GM Inequality (Q4575254) (← links)
- An Unusual Proof of the Triangle Inequality (Q4581746) (← links)
- Triforce and corners (Q4958657) (← links)
- Non-classical polynomials and the inverse theorem (Q5043348) (← links)
- Cayley Graphs Without a Bounded Eigenbasis (Q5071156) (← links)
- Optimal and algorithmic norm regularization of random matrices (Q5096658) (← links)
- Anticoncentration versus the Number of Subset Sums (Q5162870) (← links)
- Popular differences for matrix patterns (Q5863060) (← links)
- The Smallest Singular Value of Dense Random Regular Digraphs (Q5871241) (← links)
- Random symmetric matrices: rank distribution and irreducibility of the characteristic polynomial (Q5877287) (← links)
- Sparse recovery properties of discrete random matrices (Q5885198) (← links)
- A counterexample to the Bollobás–Riordan conjectures on sparse graph limits (Q5886111) (← links)
- On the smallest singular value of symmetric random matrices (Q5886337) (← links)
- Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture (Q6049024) (← links)
- Substructures in Latin squares (Q6050265) (← links)
- Friendly bisections of random graphs (Q6052387) (← links)
- Cayley graphs that have a quantum ergodic eigenbasis (Q6074041) (← links)
- Enumerating coprime permutations (Q6074974) (← links)
- Subgraph distributions in dense random regular graphs (Q6093297) (← links)
- Large deviations in random latin squares (Q6133414) (← links)
- Threshold for Steiner triple systems (Q6173554) (← links)
- On the smoothed analysis of the smallest singular value with discrete noise (Q6175421) (← links)
- Local limit theorems for subgraph counts (Q6176774) (← links)
- Paths of given length in tournaments (Q6179323) (← links)
- Optimal Minimization of the Covariance Loss (Q6193559) (← links)
- The smallest singular value of dense random regular digraphs (Q6346875) (← links)
- Anticoncentration versus the number of subset sums (Q6358601) (← links)
- Spencer's theorem in nearly input-sparsity time (Q6401589) (← links)
- Improved bounds for five-term arithmetic progressions (Q6515077) (← links)
- A central limit theorem for the matching number of a sparse random graph (Q6520985) (← links)
- Quasipolynomial bounds on the inverse theorem for the Gowers $U^{s+1}[N]$-norm (Q6523772) (← links)
- Improved Bounds for Szemer\'{e}di's Theorem (Q6523773) (← links)
