Algebraic and Algorithmic Methods in Extremal Combinatorics (Momentum MSCA Postdoctoral Fellowship)

Extremal combinatorics studies how to find the most efficient or largest possible objects under given constraints. Many real-world problems, like planning the shortest route through a list of destinations, or designing cost-effective experiments, fit this framework.

This project explores abstract versions of such problems using algebraic and algorithmic tools such as the polynomial method, which models complex structures as polynomials and examines their algebraic properties.