1.2   Research

My main research interests lie in the interplay between mathematical foundations and computation theory. The fields I am enthusiastic about include complexity theory, computability theory, automata and formal language theory and logic.

I am part of Theory Lab 5 at the computer science department of EPFL (EDIC), where I am a doctoral candidate under Mika Göös. Our group works on subfields of complexity theory, with a focus on communication complexity, circuit complexity proof complexity, and TFNP theory.

Publications

1. Sign-Rank of k-Hamming Distance is Constant (FOCS 2025, arχiv, ECCC)
   with Mika Göös, Nathan Harms and Dmitry Sokolov.

Other Research Interests

Other research areas that fascinate me include

• Reverse Mathematics and new foundations
• Non-standard Analysis
• Large Cardinal Axioms
• Automated Theory Proving and Computer Formalisation
• Tiling Problems

I am also loosely affiliated with a research effort led by Timothy Gowers on Human Oriented Automated Theorem Proving