Felix Weilacher

Felix Weilacher is an NSF Postdoctoral Fellow at the University of California, Berkeley. His research lies at the intersection of mathematical logic and combinatorics, focusing on Borel, measurable, and computable combinatorics of graphs.

Contact: weilacher@berkeley.edu, Office: 837 Evans Hall.

• Research Interests:
  • Combinatorics of graphs in descriptive set theory contexts
  • Interconnections between computability, Borel structures, and graph theory
  • Applications of the Local Lemma in Borel settings
  • Edge colorings and chromatic numbers for locally finite graphs
• GitHub Contributions:
  • dst: Descriptive set theory formalization in Lean
  • Borel Determinacy Formalization: Lean 4-based proof of Martin’s theorem

Scientific Awards:

• NSF Postdoctoral Fellowship

Notable Projects:

• Projective Hex: Implementation of Bill Taylor’s game