I'm a PhD candidate in mathematics at the University of Toronto. My research is in combinatorics, set theory, and theoretical computer science.
I care deeply about using my programming skills to solve hard problems and build tools that make abstract ideas useful.
A unified framework linking machine learning and compactness, exemplifying how the topology of function spaces encodes the algorithmic and epistemic limits of prediction.
A new border-tracing algorithm that generalizes classical image segmentation techniques from pixel-based grids to arbitrary polygonal tilings in abstract adjacency graphs.
A comprehensive object-oriented framework for the study of graph automorphism groups and more, including an optimally indexed SQL database for statistical inference and hypothesis testing.
Take the naturals as vertices of an infinite graph and flip a coin to decide whether each pair is an edge or not. Do this twice and you obtain two different infinite graphs. What is the probability that they are isomorphic? In this paper I give a new proof that the answer is, surprisingly, 100%.
We construct a dense linear order of arbitrary infinite cardinal on which Player II has a winning strategy on all payoff sets for the Cantor game.
An agentic AI framework that incorporates knowledge-graph reasoning with cryptographic vulnerability scanning through large language models (LLMs) to identify potential post-quantum security threats.
Developed as Visiting Scholar at the Fields Institute for Mathematical Sciences, in partnership with a major Canadian bank.
Markdown-based note sharing app with powerful LaTeX formatting. Share beautiful notes quick and easy, for free.