Research isn't something I plan to spend my life on, but I enjoy exploring questions that fall somewhere between algorithms, simulation, and systems. Hopefully this page grows over the years.
An investigation into constructive routing methods for connecting recursively partitioned spaces while avoiding unintended room intersections. The idea stems from my procedural generation project and explores how the method can be generalized beyond three dimensions.
An edit of OpenAI's preprint that refutes the CAT(0) conjecture for Artin groups. A shorter bound on braid translation lengths cuts their example from 116 generators to 29, with the full proof checked in Lean. A further version gets it to 11 generators, checked except for one standard assumption (van der Lek's theorem on parabolic subgroups). This was almost entirely AI-driven. I'm listing it as an experiment in that workflow, not as my own math.
Algorithms, systems programming, simulation, computational geometry, reinforcement learning, and machine learning.
Computer science student at The Ohio State University.