J16
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
2026
J15
The Four-Color Ramsey Multiplicity of Triangles
J14
The Rado Multiplicity Problem in Vector Spaces over Finite Fields
C14
Fast Isotopy Computation for T-Curves
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?
C11
An Unsure Note on an Un-Schur Problem
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 4-color Ramsey Multiplicity of Triangles
C7
Sparse Model Soups: A Recipe for Improved Pruning Via Model Averaging
P5
Forcing Graphs to be Forcing
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ₕ 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 Freĭman’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
Trust, but Verify: Formal Proof Verification with Lean
Speinshart AI Workshop Speinshart
Fast Isotopy Computation for T-Curves
8th DOxML Conference Tokyo
Coloring the Plane with Neural Networks
PACOH Workshop on AI for Combinatorics Jeju, South Korea
Coloring the Plane with Neural Networks
IBS ECOPRO Seminar Institute for Basic Science (IBS) Daejeon
An Unsure Talk on an Un-Schur Problem
Flags in the Mountains Workshop Bellvue
Formalizing Flag Algebras in Lean
Flags in the Mountains Workshop Bellvue
2025
Solving (very) large Flag Algebra SDPs
AIM Workshop on Flag Algebras Pasadena
Neural Discovery in Mathematics
42nd ICML Conference Vancouver
Infinitely Many Counterexamples to a Conjecture of Lovász
Forcing Graphs to be Forcing
Coloring the plane with neural networks
NTU Seminar on Advanced Topics in Combinatorics National Taiwan University Taipei
An Unsure Talk on an Un-Schur Problem
17th CANT Conference New York
Neural Discovery in Mathematics
7th DOxML Conference Kyoto
An Unsure Talk on an Un-Schur Problem
KIT Discrete Mathematics Group Seminar Karlsruhe Institute of Technology (KIT)
Forcing Graphs to be Forcing
Heidelberg TCS and Discrete Mathematics Seminar Heidelberg University
2024
Coloring the Plane with Neural Networks
An Unsure Talk on an Un-Schur Problem
Extending the Continuum of Six-Colorings
Colloquium on Combinatorics (KolKom) Heidelberg
The Role of Machine Learning for Mathematics
CO@Work Summer School Berlin
Extending the Continuum of Six-Colorings
13th Discrete Mathematics Days Conference Alcalá de Henares
2023
The Role of Machine Learning for Mathematics
BMS RTA 8 Workshop Berlin
The Rado Multiplicity Problem in Vector Spaces
EUROCOMB 2023 Conference Prague
Computational Challenges in Flag Algebra Proofs
Flag Algebras in Additive Combinatorics
5th DOxML Conference Tokyo
Towards Flag Algebras in Additive Combinatorics
Towards Flag Algebras in Additive Combinatorics
15th CANT Conference New York
Computer-assisted Proofs in Extremal Combinatorics
Waischenfeld Optimization and ML Workshop Waischenfeld
The four-color Ramsey multiplicity of triangles
UPC LIMDA Joint Seminar Universitat Politècnica de Catalunya Barcelona
Fully Computer-assisted Proofs in Extremal Combinatorics
37th AAAI Conference Washington DC
Fully Computer-assisted Proofs in Extremal Combinatorics
2022
Leveraging Combinatorial Symmetries in Flag Algebra SDPs
Proofs in Extremal Combinatorics through Optimization
New Ramsey Multiplicity Bounds and Search Heuristics
New Ramsey multiplicity bounds and search heuristics
UPC LIMDA Joint Seminar Universitat Politècnica de Catalunya Barcelona
2019
A step beyond Freĭman’s theorem for set addition modulo a prime
The probabilistic intuition in positional games
TU Ilmenau Research Seminar on Combinatorics Technische Universität Ilmenau
Odd Cycle Games and Connected Rules
Odd Cycle Games and Connected Rules
1st GAPCOMB Workshop Campelles
Intervals in the Hales–Jewett theorem
LSE PhD Seminar on Combinatorics London School of Economics
Intervals in the Hales–Jewett theorem
Oxford Combinatorial Theory Seminar University of Oxford
2018
Intervals in the Hales–Jewett theorem
On a Problem of Sárközy and Sós for Multivariate Linear Forms
Going Beyond 2.4 in Freĭman’s 2.4k-theorem
10th CANT Conference New York
Going beyond 2.4 in Freĭman’s 2.4k-theorem
GRAPHS@IMPA Seminar Instituto de Matemática Pura e Aplicada (IMPA) Rio de Janeiro
2017
On a question of Sárközy and Sós
Sparse supersaturation and extremal results for linear homogeneous systems
UPC LIMDA Joint Seminar Universitat Politècnica de Catalunya Barcelona
Rado Positional Games
Music of Numbers Conference Madrid
Generalized Positional van der Waerden Games
Birmingham Interactions with Combinatorics Workshop Birmingham
Random strategies are nearly optimal for generalized van der Waerden games
UPC LIMDA Joint Seminar Universitat Politècnica de Catalunya Barcelona
2016
Threshold functions for systems of equations in random sets
UPC LIMDA Joint Seminar Universitat Politècnica de Catalunya Barcelona
Van der Waerden games (II)
Van der Waerden games (I)
2015
What is discrete Fourier analysis?
BMS “What is…?” Seminar Berlin Mathematical School
Threshold functions for systems of equations in random sets
No talks match your search.
54 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.