On Acknowledgements

Home | My CV and research statement | Contact me

I read a lot of preprints on the arxiv, and frequently reach out to authors with a rather thorough list of typos. Here I have compiled a (currently incomplete) list of preprints where I have been acknowledged for this. The dates listed are when I read the relevent papers.

If you wish to acknowledge me, I prefer to be referred to as Zach Hunter. Please do not feel obliged to acknowledge me if all I've done is point out some minor typos (though you are free to do so)!

• On the independence number of sparser random Cayley graphs (Jun 2024), by Marcelo Campos, Gabriel Dahia, and João Marciano.
• An explicit economical additive basis (May 2024), by Vishesh Jain, Huy Tuan Pham, Mehtaab Sawhney, and Dmitrii Zakharov.
• Marton's Conjecture in abelian groups with bounded torsion (Apr 2024), by Timothy Gowers, Ben Green, Freddie Manners, and Terence Tao.
• On further questions regarding unit fractions (Apr 2024), by Yang Liu and Mehtaab Sawhney.
• Quasipolynomial bounds on the inverse theorem for the Gowers $U^{s+1}[N]$-norm (Apr 2024), by James Leng, Ashwin Sah, and Mehtaab Sawhney.
• Improved Bounds for Szemerédi's Theorem (Feb 2024), by James Leng, Ashwin Sah, and Mehtaab Sawhney.
• The Quantitative Fractional Helly theorem (Feb 2024), by Nóra Frankl, Attila Jung, and István Tomon.
• An improved lower bound on the Shannon capacities of complements of odd cycles (Feb 2024), by Daniel Zhu.
• Hamiltonicity of expanders: optimal bounds and applications (Feb 2024), by Nemanja Draganić, Richard Montgomery, David Munhá Correia, Alexey Pokrovskiy, and Benny Sudakov.
• A Dense Model Theorem for the Boolean Slice (Feb 2024), by Gil Kalai, Noam Lifshitz, Dor Minzer, and Tamar Ziegler.
• New bounds for Szemeredi's theorem, II: A new bound for $r_4(N)$ (Dec 2023), by Ben Green and Terence Tao. Disclaimer: I have not read the entirety of this work. I just realized that there was something missing from a result in the appendix, due to a similar omission in the paper of Leng-Sah-Sawhney mentioned in the bullet immediately below.
• Improved bounds for five-term arithmetic progressions (Dec 2023), by James Leng, Ashwin Sah, and Mehtaab Sawhney.
• On a conjecture of Marton (Nov 2023), by Timothy Gowers, Ben Green, Freddie Manners, and Terence Tao.
• Waring's problem with restricted digits (Sep 2023), by Ben Green.
• Monochromatic Sums and Products over $\mathbb{Q}$ (Jul 2023), by Ryan Alweiss.
• Kemperman's inequality and Freiman's lemma via few translates (Jul 2023), by Yifan Jing and Akshat Mugdal.
• Graph-codes (Feb 2023), by Noga Alon. Some minor corrections, but I also answered a question posed in the conclusion.
• The existence of subspace designs (Dec 2022), by Peter Keevash, Ashwin Sah, and Mehtaab Sawhney.
• Monochromatic Sums and Products of Polynomials (Nov 2022), by Ryan Alweiss.
• A multidimensional Ramsey Theorem (Oct 2022), by Antonío Girão, Gal Kronenberg, and Alex Scott.
• Anticoncentration in Ramsey graphs and a proof of the Erdős-McKay conjecture (Aug 2022), by Matthew Kwan, Ashwin Sah, Lisa Sauermann, and Mehtaab Sawhney.
• Hamilton cycles in a semi-random graph model (Aug 2022), by Alan Frieze and Gregory Sorkin.
• Three coloring via triangle counting (Mar 2022), by Zachary Hamaker and Vincent Vatter.
• Substructures in Latin squares (Feb 2022), by Matthew Kwan, Ashwin Sah, Mehtaab Sawhney, and Michael Simkin.
• The Dimension of Divisibility Orders and Multiset Posets (Feb 2022), by Milan Haiman.
• High-Girth Steiner Triple Systems (Jan 2022), by Matthew Kwan, Ashwin Sah, Mehtaab Sawhney, and Michael Simkin.
• Quasiplanar graphs, string graphs, and the Erdos-Gallai problem (Dec 2021), by Jacob Fox, Janos Pach, and Andrew Suk.
• A counter-example to the probabilistic universal graph conjecture via randomized communication complexity (Nov 2021), by Lianna Hambardzumyan, Hamed Hatami, and Pooya Hatami.
• Tight Ramsey bounds for multiple copies of a graph (Aug 2021), by Matija Bucic and Benny Sudakov. Disclaimer: I did not finish reading this preprint, instead I was acknowledged for finding a way to modify their methods to solve a problem posed in their conclusion.
• The runsort permuton (Jun 2021), by Noga Alon, Colin Defant, and Noah Kravitz.
• Large deviations in random Latin squares (Jun 2021), by Matthew Kwan, Ashwin Sah, and Mehtaab Sawhney.