Further results on arc and bar k-visibility graphs. - Mehtaab Sawhney; Jonathan Weed (CoRR, 2016)

A Major-Index Preserving Map on Fillings. - Per Alexandersson; Mehtaab Sawhney (Electron. J. Comb., 2017)

A Telescoping Proof of the AM-GM Inequality. - Mehtaab S. Sawhney (Am. Math. Mon., 2017)

On a Conjecture Regarding Permutations which Destroy Arithmetic Progressions. - Mehtaab Sawhney; David Stoner (Electron. J. Comb., 2018)

On the discrepancy between two Zagreb indices. - Ashwin Sah; Mehtaab Sawhney (Discret. Math., 2018)

Characters of independent Stanley sequences. - Richard A. Moy; Mehtaab Sawhney; David Stoner (Eur. J. Comb., 2018)

On Symmetric But Not Cyclotomic Numerical Semigroups. - Mehtaab Sawhney; David Stoner (SIAM J. Discret. Math., 2018)

The number of independent sets in an irregular graph. - Ashwin Sah; Mehtaab Sawhney; David Stoner; Yufei Zhao (J. Comb. Theory B, 2019)

Hypercube packings and coverings with higher dimensional rooks. - Mehtaab Sawhney; David Stoner (Australas. J Comb., 2020)

On the real Davies' conjecture. - Vishesh Jain; Ashwin Sah; Mehtaab Sawhney (CoRR, 2020)

Perfectly Sampling k≥ (8/3 +o(1))Δ-Colorings in Graphs. - Vishesh Jain; Ashwin Sah; Mehtaab Sawhney (CoRR, 2020)

On the smoothed analysis of the smallest singular value with discrete noise. - Vishesh Jain; Ashwin Sah; Mehtaab Sawhney (CoRR, 2020)

Discrepancy minimization via a self-balancing walk. - Ryan Alweiss; Yang P. Liu; Mehtaab Sawhney (STOC, 2021)

Perfectly sampling k ≥ (8/3 + o(1))Δ-colorings in graphs. - Vishesh Jain; Ashwin Sah; Mehtaab Sawhney (STOC, 2021)

Anticoncentration versus the number of subset sums. - Vishesh Jain; Ashwin Sah; Mehtaab Sawhney (CoRR, 2021)

A counterexample to the Bollobás-Riordan conjectures on sparse graph limits. - Ashwin Sah; Mehtaab Sawhney; Jonathan Tidor; Yufei Zhao (Comb. Probab. Comput., 2021)

A Gaussian Fixed Point Random Walk. - Yang P. Liu; Ashwin Sah; Mehtaab Sawhney (ITCS, 2022)

Approximate counting and sampling via local central limit theorems. - Vishesh Jain; Will Perkins 001; Ashwin Sah; Mehtaab Sawhney (STOC, 2022)

On the smallest singular value of symmetric random matrices. - Vishesh Jain; Ashwin Sah; Mehtaab Sawhney (Comb. Probab. Comput., 2022)

Distribution of the threshold for the symmetric perceptron. - Ashwin Sah; Mehtaab Sawhney (FOCS, 2023)

Spencer's theorem in nearly input-sparsity time. - Vishesh Jain; Ashwin Sah; Mehtaab Sawhney (SODA, 2023)

Paths of given length in tournaments. - Ashwin Sah; Mehtaab Sawhney; Yufei Zhao (Comb. Theory, 2023)

Optimal Minimization of the Covariance Loss. - Vishesh Jain; Ashwin Sah; Mehtaab Sawhney (IEEE Trans. Inf. Theory, 2023)

Sparse recovery properties of discrete random matrices. - Asaf Ferber; Ashwin Sah; Mehtaab Sawhney; Yizhe Zhu (Comb. Probab. Comput., 2023)

Online Edge Coloring via Tree Recurrences and Correlation Decay. - Janardhan Kulkarni; Yang P. Liu; Ashwin Sah; Mehtaab S. Sawhney; Jakub Tarnawski (SIAM J. Comput., 2024)

Quasipolynomial bounds for the corners theorem. - Michael Jaber; Yang P. Liu; Shachar Lovett; Anthony Ostuni; Mehtaab Sawhney (Electron. Colloquium Comput. Complex., 2025)