what am i up to?
go back ↰
# TAing
I’m TAing CMSC 28400 (Intro to Cryptography). My office hours are
Tuesdays, 11a-12p in JCL 207 – please come by!
↸ Back to top
# on my mind
It is crazy that we have made machines
that can think. I feel caught between awe/amazement at this
futuristic new technology, and concern for how it will negatively impact
the world. Academia is lucky in that it is largely self-governing; I’ve
been thinking a lot about what changes math-adjacent academics could
take to engage with this technology productively and ethically.
↸ Back to top
# phases of research
I’ve been thinking a lot about how research projects tend to fall
into three consecutive phases.
- Study/Exploration: You are just learning about the
area, trying to develop intuition and learn techniques. This can take a
long time, and sometimes you explore for a while and ultimately realize
there is no path towards interesting results.
- Discovery: Now you have a lot of intuition for the
area and can prove things! This is a very exciting interval, but often
short (or you get stuck here and it never ends, until you decide to give
up).
- Communication: You’ve basically determined your
results but are trying to figure out how to communicate it —
organizing/simplifying results, writing the paper, developing talks,
etc. This phase always takes longer than I think, but I really enjoy it.
It’s interesting to see how the act of communicating can help you refine
the results themselves.
For my own sanity, it’s helpful to keep track of the states of my
various projects:
Communication
Discovery
- Public-key encryption from planted dense subgraph
- Algorithms for planted random subgraph
- 10x10 enumeration
- Impeaching “mayors” of universal covers (gave up for now)
Study/Exploration
- ReCom on dense random graphs
- The overlap gap property
- Average-case reductions between IS and LCIS
- Prophet inequalities with cancellation costs (on hold)
- AI and the Fourth Amendment (on hold)
- Actuarially fair insurance pricing (on hold)
- Distinguishing permutations from functions (on hold)
- Job scheduling lower bound (on hold)
↸ Back to top
# big (TCS) questions
Last updated November 2026.
↸ Back to top