Skip To Main Content
Mehtaab Sawhney on Muck Rack

Mehtaab Sawhney

As seen in: arXiv
Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work. Claim your profile

Get in touch with Mehtaab

Contact Mehtaab, search articles and posts on X, monitor coverage, and track replies from one place.

Learn more about Muck Rack

Actions

Share this page

Is this you?

As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile

Articles

[2604.06609] Short proofs in combinatorics, probability and number theory II

|
By Mehtaab Sawhney, Mark Sellke, Moe Putterman
| arXiv
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Open in Who Shared View Duplicates (699) Issue with article?

[2506.13010] On polynomial progressions via transference

|
By Mehtaab Sawhney
| arXiv
arXiv:2506.13010 (math) View PDF HTML (experimental) Comments: Subjects: Number Theory (math.NT); Combinatorics (math.CO) Cite as: arXiv:2506.13010 [math.NT] (or arXiv:2506.13010v1 [math.NT] for this version) https://doi.org/10.48550/arXiv.2506.13010 Submission history From: Mehtaab Sawhney [ view email] [v1] Mon, 16 Jun 2025 00:38:54 UTC (38 KB) Bibliographic Tools Bibliographic Explorer Toggle Bibliographic Explorer () Connected Papers Toggle Connected Papers (What is Connected Papers?)...
Open in Who Shared View Duplicates (80) Issue with article?

[2310.17600] The sparse circular law, revisited

|
By Julian Sahasrabudhe, Mehtaab Sawhney
| arXiv
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Open in Who Shared View Duplicates (407) Issue with article?
See all 4 articles