Hello. I am Felix Weilacher, a postdoc at UC Berkeley. Here is a current CV. I can be reached at weilacher AT berkeley DOT edu.
Papers:
Borel Homomorphisms from Forests to Kneser Graphs, preprint
G_delta Circle Squaring, preprint (with Spencer Unger and Narmada Varadarajan)
LCLs in the Borel Hierarchy, preprint
Separating Complexity Classes of LCL Problems on Grids, preprint (with Katalin Berlow, Anton Bernshteyn, and Clark Lyons)
Measurable Regular Subgraphs, Proceedings of the AMS (to appear) (with Matt Bowen and Clinton Conley)
Borel Versions of the Local Lemma and LOCAL Algorithms for Graphs of Finite Asymptotic Separation Index, Transactions of the AMS (with Anton Bernshteyn)
Computable vs Descriptive Combinatorics of Local Problems on Trees, Journal of Symbolic Logic
Descriptive Combinatorics, Computable Combinatorics, and ASI Algorithms, preprint (with Long Qian)
Definable Kőnig Theorems, Proceedings of the AMS (with Matt Bowen)
Borel Edge Colorings for Finite Dimensional Groups, Israel Journal of Mathematics
Descriptive Chromatic Numbers of Locally Finite and Everywhere Two Ended Graphs, Groups, Geometry, and Dynamics
Marked Groups with Isomorphic Cayley Graphs but Different Borel Combinatorics, Fundamenta Mathematicae,
See also My arXiv page
Notes:
Definable Vizing Theorems (with Long Qian)
Measure Asymptotic Separation Index and Hyperfiniteness
Borel Vizing's Theorem for 2-Ended Groups
Other:
Projective Hex, an implementation I made of the ultimate form of the game Hex, invented by Bill Taylor.
Here is my GitHub, where I mostly work on descriptive set theory for mathlib using the lean theorem prover.