I am a Postdoctoral Fellow in the Department of Mathematics, Statistics, and Computer Science at the University of Illinois at Chicago hosted by the TRIPODS Institute for Foundations of Data Science.

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, Algorithms, Coding Theory, and the Mathematical Foundations of Data Science.

**Email: **adityap something uic something edu

## Research

*On the geometry of stable Steiner tree instances.** *(with James Freitag, Neshat Mohammadi, and Lev Reyzin)

under submission

*Enumerating independent sets in Abelian Cayley graphs.** *(with Liana Yepremyan)

under submission

*Approximately counting independent sets in bipartite graphs via graph containers.** *(with Will Perkins and Matthew Jenssen)

SODA 2022

*Independent sets of a given size and structure in the hypercube.** *(with Will Perkins and Matthew Jenssen)

submitted

*On the list recoverability of **randomly** punctured codes.* (with Ben Lund)

RANDOM 2020

*On the AC0[+] complexity of Andreev's Problem.*

FSTTCS 2019

*A spectral bound on hypergraph discrepancy.*

ICALP 2020, Best Student Paper award

*Simplified inpproximability of hypergraph coloring via t-agreeing families.* (with Per Austrin and Amey Bhangale)

manuscript

*Improved efficiency for explicit covering codes matching the sphere-covering bound.* (with Yihan Zhang).

ISIT 2020

*Discrepancy in random hypergraph models.*

manuscript

*Improved Inapproximability of rainbow coloring.* (with Per Austrin and Amey Bhangale)

SODA 2020

*Syndrome decoding of Reed-Muller codes and tensor decomposition over finite fields.* (with Swastik Kopparty)

SODA 2018

*A short note on the joint entropy of n/2-wise independence.* (with Amey Bhangale)

ISIT 2018

*On the size of the image of a linear map on a finite grid.* (with John Kim)

manuscript

*On zeros of a polynomial in a finite grid.* (with Anurag Bishnoi, Pete Clark, and John Schmitt)

Combinatorics, Probability, and Computing 2018

## Teaching

Fall 2021: Mathematical Theory of Artificial Intelligence

**Previous: **Mathematical Foundations of Data Science

## Other

I organzed a mini-workshop on some recent applications of graph container methods.

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.