I am currently a TRIPODS Postdoctoral Fellow in the Department of Mathematics, Statistics, and Computer Science at the University of Illinois at Chicago.
I have recently received my PhD in Computer Science from Rutgers University under the supervision of Swastik Kopparty. Before Rutgers, I spent two years at Chennai Mathematical Institute.
I am broadly interested in Discrete Mathematics, Probability, Coding Theory, etc..
CV (sometimes out of date)
Email: adityap something uic something edu
Research
On the list recoverability of randomly punctured codes. (with Ben Lund) [ECCC] [arXiv]
On the AC0[+] complexity of Andreev's Problem. [ECCC] [arXiv]
A spectral bound on hypergraph discrepancy. [arXiv]
Simplified inpproximability of hypergraph coloring via t-agreeing families. (with Per Austrin and Amey Bhangale) [ECCC] [arXiv]
Improved efficiency for explicit covering codes matching the sphere-covering bound. (with Yihan Zhang). [arXiv]
Discrepancy in random hypergraph models. [arXiv]
Improved Inapproximability of rainbow coloring. (with Per Austrin and Amey Bhangale) [arXiv]
Syndrome decoding of Reed-Muller codes and tensor decomposition over finite fields. (with Swastik Kopparty) [arXiv]
A short note on the joint entropy of n/2-wise independence. (with Amey Bhangale) [arXiv]
On the size of the image of a linear map on a finite grid. (with John Kim) [arXiv]
On zeros of a polynomial in a finite grid. (with Anurag Bishnoi, Pete Clark, and John Schmitt) [arXiv]
Teaching
Spring 2021: Mathematical Foundations of Data Science
Other
I am organizing a mini-workshop on some recent applications of graph container methods. Please register if you want to (virtually) attend.
I gave a talk at the STOC 2020 workshop on Recent advances in Discrepancy and Applications on discrepancy of random and pseudorandom hypergraphs. Slides are available in the link.