About
I am an undergraduate at UMass Amherst studying complexity theory. I am advised by Andrew McGregor!
Research
Most recently, I have been interested in annotated data streams: they are similar to MA communication complexity but for a data stream.
- Metacomplexity and circuit complexity
- Interactive proofs and zero-knowledge.
Currently thinking about
In the annotated data stream model, is it possible to compute frequency based function $\sum_{i\in[n]}g(f_i)$ for any $g:\mathbb Z\to\mathbb Z^+$, where $f_i$ is the frequency of the $i^{th}$ letter using $\tilde O(\sqrt n)$ help and verification cost.
News
- June 2026 I am participating in the UMass Math REU under Paul Hacking. We are working on using mirror symmetry for counting ordinary double points.
- February 2026 I am starting my Honor's Thesis with my advisor Andrew McGregor on annotated data streams.
- October 2025 I am having biweekly meetings with David A. Mix Barrington to read up on descriptive complexity, algebraic automata theory, and correlation bounds.
- September 2025 I am having weekly meetings with Dean Lin as part of the UMass Math DRP about elliptic curve cryptography.
Presentations
Teaching
- CS 311: Intro to Algorithms | Head UCAFall 2026
- CS 501: Formal Language Theory | UCASpring 2026
Projects
- Complexle | A Wordle-like game for guessing complexity classes.
- Flops Calculator | Small program to compute the flops of a variety using its toric fan.
Links
- Complexity Zoo | A good source to find your favorite complexity classes
- Theory@UMass | The undergraduate theory club me and my friends founded. Ask me about it!
- DIMACS Frontiers in Complexity Theory | My favorite lecture series