C14
Research
I describe my approach to mathematics as computational thinking: make a problem accessible through computational tools. Pure mathematics gives the application while applied mathematics gives the tool.
Publications and Preprints
2027
C11
An Unsure Note on an Un-Schur Problem
2026
J16
An Unsure Note on an Un-Schur Problem
J15
The four-color Ramsey multiplicity of triangles
J14
The Rado multiplicity problem in vector spaces over finite fields
C13
Neural Sum-of-Squares: Certifying the Nonnegativity of Polynomials with Transformers
P7
Limits of combinatorial patchworking
2025
J13
Compression-aware training of neural networks using Frank–Wolfe
J12
New Ramsey Multiplicity Bounds and Search Heuristics
C12
Neural Discovery in Mathematics: Do Machines Dream of Colored Planes?
P6
Infinitely many counterexamples to a conjecture of Lovász
2024
J11
Extending the Continuum of Six-Colorings
C10
Categorification of Flag Algebras
C9
Extending the Continuum of Six-Colorings
C8
The Four-Color Ramsey Multiplicity of Triangles
C7
Sparse Model Soups: A Recipe for Improved Pruning via Model Averaging
P5
Adjunctions, Box Products, and Forcing Families
2023
C6
How I Learned to Stop Worrying and Love Retraining
C5
The Rado Multiplicity Problem in Vector Spaces over Finite Fields
C4
Fully Computer-Assisted Proofs in Extremal Combinatorics
P4
PERP: Rethinking the Prune-Retrain Paradigm in the Era of LLMs
2022
J10
Another Note on Intervals in the Hales–Jewett Theorem
C3
New Ramsey multiplicity bounds and search heuristics
2021
J9
On strong infinite Sidon and \(B_h\) sets and random sets of integers
J8
An Erdős–Fuchs theorem for ordered representation functions
2020
J7
On the odd cycle game and connected rules
J6
A step beyond Freiman’s theorem for set addition modulo a prime
J5
On a problem of Sárközy and Sós for multivariate linear forms
P3
Projection-Free Adaptive Gradients for Large-Scale Optimization
P2
Deep Neural Network Training with Frank-Wolfe
2019
J4
On the optimality of the uniform random strategy
J3
Additive Volume of Sets Contained in Few Arithmetic Progressions
P1
Independent Chains in Acyclic Posets
2018
J2
Threshold functions and Poisson convergence for systems of equations in random sets
C2
On a problem of Sárközy and Sós for multivariate linear forms
2017
J1
A Note on Sparse Supersaturation and Extremal Results for Linear Homogeneous Systems
C1
Random Strategies are Nearly Optimal for Generalized van der Waerden Games
No publications match your search.
37 entries
Talks
2026
Do Machines Dream of Colored Planes?
BMS/MATH+ Celebration Ceremony MATH+ Berlin
Überschwemmt mit KI-generierten Beweisen: Was ist die Zukunft der Mathematik?
Mathenacht Aus Berlin, Bonn Und Münster Online
With Thomas NikolausThoralf Räsch (Moderator)Peter Scholze
Trust, but Verify: Formal Proof Verification with Lean
IOL @ Speinshart Scientific Center for AI and SuperTech ZIB Speinshart
Fast Isotopy Computation for \(T\)-Curves
Conference on Discrete Optimization and Machine Learning Science Tokyo Ookayama
Coloring the Plane with Neural Networks
Coloring the Plane with Neural Networks
IBS Extremal Combinatorics and Probability Group IBS Daejeon
An Unsure Talk on an Un-Schur Problem
Flags in the Mountains CSU Bellvue
Formalizing Flag Algebras in Lean
Flags in the Mountains CSU Bellvue
2025
Solving (very) Large Flag Algebra SDPs
Flag Algebras and Extremal Combinatorics AIM Pasadena
Neural Discovery in Mathematics
Infinitely Many Counterexamples to a Conjecture of Lovász
Research Seminar Combinatorics FUB Berlin
Forcing Graphs to Be Forcing
Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications Science Tokyo Ookayama
Coloring the Plane with Neural Networks
Advanced Topics in Combinatorics II NTU Taipei
An Unsure Talk on an Un-Schur Problem
Combinatorial and Additive Number Theory Conference CUNY Online
Neural Discovery in Mathematics
Conference on Discrete Optimization and Machine Learning RIMS Kyoto
An Unsure Talk on an Un-Schur Problem
Research Seminar AG Discrete Mathematics KIT Karlsruhe
Forcing Graphs to Be Forcing
Research Seminar Theoretical Computer Science & Discrete Mathematics U Heidelberg Heidelberg
2024
Coloring the Plane with Neural Networks
Research Seminar Combinatorics FUB Berlin
An Unsure Talk on an Un-Schur Problem
Research Seminar Combinatorics FUB Berlin
Extending the Continuum of Six-Colorings
Kolloquium Über Kombinatorik U Heidelberg Heidelberg
The Role of Machine Learning for Mathematics
Computational Optimization at Work ZIB Berlin
Extending the Continuum of Six-Colorings
Discrete Mathematics Days UAH Alcalá de Henares
2023
The Role of Machine Learning for Mathematics
BMS RTA 8 – Practical Course ZIB Berlin
The Rado Multiplicity Problem in Vector Spaces Over Finite Fields
European Conference on Combinatorics, Graph Theory and Applications CU Prague
Computational Challenges in Flag Algebra Proofs
Flag Algebras in Additive Combinatorics
Conference on Discrete Optimization and Machine Learning GRIPS Tokyo
Towards Flag Algebras in Additive Combinatorics
Towards Flag Algebras in Additive Combinatorics
Combinatorial and Additive Number Theory Conference CUNY Online
Computer-Assisted Proofs in Extremal Combinatorics
Workshop on Optimization and Machine Learning Fraunhofer Waischenfeld
The Four-Color Ramsey Multiplicity of Triangles
LIMDA Seminar UPC Barcelona Barcelona
Fully Computer-Assisted Proofs in Extremal Combinatorics
AAAI Conference on Artificial Intelligence Washington, DC
Fully Computer-Assisted Proofs in Extremal Combinatorics
2022
Leveraging Combinatorial Symmetries in Flag Algebra-Based SDP Formulations
Workshop on Recent Advances in Optimization Fields Institute Toronto
Proofs in Extremal Combinatorics Through Optimization
New Ramsey Multiplicity Bounds and Search Heuristics
Discrete Mathematics Days UC Santander Santander
New Ramsey Multiplicity Bounds and Search Heuristics
LIMDA Seminar UPC Barcelona Barcelona
2019
A Step Beyond Freiman’s Theorem for Set Addition Modulo a Prime
Research Seminar Combinatorics FUB Berlin
The Probabilistic Intuition in Positional Games
Research Seminar Large Networks and Random Graphs TU Ilmenau Ilmenau
Odd Cycle Games and Connected Rules
Workshop on Geometric, Algebraic and Probabilistic Combinatorics UPC Barcelona Campelles
Odd Cycle Games and Connected Rules
Postgraduate Combinatorial Conference Oxford Oxford
Intervals in the Hales-Jewett Theorem
Seminar on Combinatorics, Games and Optimisation London School of Economics London
Intervals in the Hales-Jewett Theorem
Combinatorial Theory Seminar Oxford Oxford
Intervals in the Hales-Jewett Theorem
Extremal Set Theory Seminar Rény Institute Budapest
2018
Intervals in the Hales-Jewett Theorem
Research Seminar Combinatorics FUB Berlin
On a Problem of Sárközy and Sós for Multivariate Linear Forms
Discrete Mathematics Days University of Seville Sevilla
Going Beyond 2.4 in Freiman’s 2.4k-Theorem
Combinatorial and Additive Number Theory Conference CUNY New York
Going Beyond 2.4 in Freiman’s 2.4k-Theorem
GRAPHS at IMPA IMPA Rio de Janeiro
2017
On a Question of Sárközy and Sós
Research Seminar Combinatorics FUB Berlin
Sparse Supersaturation and Extremal Results for Linear Homogeneous Systems
LIMDA Seminar UPC Barcelona Barcelona
Rado Positional Games
The Music of Numbers Conference – In Honor of Cilleruelo ICMAT Madrid
Generalized Positional van der Waerden Games
Interactions with Combinatorics University of Birmingham Birmingham
Random Strategies Are Nearly Optimal for Generalized van der Waerden Games
LIMDA Seminar UPC Barcelona Barcelona
Additive Structures in Random Sets
Joint TAU-FUB Workshop on Graph and Hypergraph Coloring Tel Aviv University Tel Aviv
2016
Threshold Functions for Systems of Equations in Random Sets
LIMDA Seminar UPC Barcelona Barcelona
Van der Waerden Games (II)
Research Seminar Combinatorics FUB Berlin
Van der Waerden Games (I)
Research Seminar Combinatorics FUB Berlin
2015
What Is Discrete Fourier Analysis?
"What Is ...?" Seminar BMS Berlin
Threshold Functions for Systems of Equations in Random Sets
Research Seminar Combinatorics FUB Berlin
No talks match your search.
58 entries
Projects
Oct 2026 – Sep 2029
MATH+ Excellence Cluster MDU-5
Verified Combinatorial Computing in Lean
Formalizes combinatorial computations in Lean to produce machine-checked proof certificates.
Jan 2024 – Dec 2025
MATH+ Excellence Cluster & MaRDI AA5-9
LEAN on Me
Formalizes results from combinatorics and optimization in Lean and develops proof tactics and course material for formal verification.
Jun 2023 – May 2027
BMFTR 16IS23025B
AI4Forest
Develops deep-learning methods for global forest monitoring: 10 m canopy-height mapping, biomass estimation, and disturbance detection.
Oct 2022 – Sep 2025
MATH+ Excellence Cluster EF1-21
Scaling up Flag Algebras in Combinatorics
Scales Razborov's flag algebras through symmetry reduction and extends them to new settings such as Rado multiplicity in vector spaces.
Jan 2021 – May 2024
MATH+ Excellence Cluster EF1-12
Learning Extremal Structures in Combinatorics
Combines search heuristics with flag algebras to find and certify extremal graphs, giving new Ramsey multiplicity bounds.
Jan 2021 – Dec 2022
MATH+ Excellence Cluster EF1-9
Adaptive Algorithms through Machine Learning
Uses machine learning to adapt branch-and-cut solvers at run time, learning cut selection, branching, and heuristic scheduling.