Mehtaab Sawhney

According to our database, Mehtaab Sawhney authored at least 24 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Online Edge Coloring via Tree Recurrences and Correlation Decay.

Janardhan Kulkarni, Yang P. Liu, Ashwin Sah, Mehtaab S. Sawhney, Jakub Tarnawski

SIAM J. Comput., February, 2024

2023

Sparse recovery properties of discrete random matrices.

Asaf Ferber, Ashwin Sah, Mehtaab Sawhney, Yizhe Zhu

Comb. Probab. Comput., March, 2023

Optimal Minimization of the Covariance Loss.

Vishesh Jain, Ashwin Sah, Mehtaab Sawhney

IEEE Trans. Inf. Theory, February, 2023

Spencer's theorem in nearly input-sparsity time.

Vishesh Jain, Ashwin Sah, Mehtaab Sawhney

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Distribution of the threshold for the symmetric perceptron.

Ashwin Sah, Mehtaab Sawhney

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

On the smallest singular value of symmetric random matrices.

Vishesh Jain, Ashwin Sah, Mehtaab Sawhney

Comb. Probab. Comput., 2022

Approximate counting and sampling via local central limit theorems.

Vishesh Jain, Will Perkins, Ashwin Sah, Mehtaab Sawhney

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

A Gaussian Fixed Point Random Walk.

Yang P. Liu, Ashwin Sah, Mehtaab Sawhney

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

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

Anticoncentration versus the number of subset sums.

Vishesh Jain, Ashwin Sah, Mehtaab Sawhney

CoRR, 2021

Perfectly sampling <i>k</i> ≥ (8/3 + <i>o</i>(1))Δ-colorings in graphs.

Vishesh Jain, Ashwin Sah, Mehtaab Sawhney

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Discrepancy minimization via a self-balancing walk.

Ryan Alweiss, Yang P. Liu, Mehtaab Sawhney

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

2020

On the smoothed analysis of the smallest singular value with discrete noise.

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 real Davies' conjecture.

Vishesh Jain, Ashwin Sah, Mehtaab Sawhney

CoRR, 2020

Hypercube packings and coverings with higher dimensional rooks.

Mehtaab Sawhney, David Stoner

Australas. J Comb., 2020

2019

The number of independent sets in an irregular graph.

Ashwin Sah, Mehtaab Sawhney, David Stoner, Yufei Zhao

J. Comb. Theory, Ser. B, 2019

2018

On Symmetric But Not Cyclotomic Numerical Semigroups.

Mehtaab Sawhney, David Stoner

SIAM J. Discret. Math., 2018

Characters of independent Stanley sequences.

Richard A. Moy, Mehtaab Sawhney, David Stoner

Eur. J. Comb., 2018

On the discrepancy between two Zagreb indices.

Ashwin Sah, Mehtaab Sawhney

Discret. Math., 2018

On a Conjecture Regarding Permutations which Destroy Arithmetic Progressions.

Mehtaab Sawhney, David Stoner

Electron. J. Comb., 2018

2017

A Telescoping Proof of the AM-GM Inequality.

Mehtaab S. Sawhney

Am. Math. Mon., 2017

A Major-Index Preserving Map on Fillings.

Per Alexandersson, Mehtaab Sawhney

Electron. J. Comb., 2017

2016

Further results on arc and bar k-visibility graphs.

Mehtaab Sawhney, Jonathan Weed

CoRR, 2016