Activities

We are organizing a workshop on combinatorics, algorithms, and geometry, scheduled for March 2026. Its aim is to foster synergies among participating researchers and encourage meaningful exchange across different communities.

We are grateful to receive funding by the DFG priority programme 'Combinatorial Synergies' and by the DFG-Heisenberg project 'Principles of combinatorial algorithms'.

More information can be found here.

Heisenberg project "Principles of combinatorial algorithms" (DFG project 522790373) 2023-2028

In this project, we tackle several long-standing and fundamental problems at the interface of mathematics and computer science. Specifically, the project centers around the following topics:

• Efficient algorithms for generating combinatorial objects
• Reconfiguration problems, Gray codes
• Lovász’ conjecture on Hamilton paths in vertex-transitive graphs
• Partially ordered sets (symmetric chain decompositions)
• Discrete and combinatorial geometry (rectangulations, non-crossing matchings, Venn diagrams)
• Algebraic combinatorics (lattice congruences, polytopes, quotientopes)
• Connections to combinatorial optimization on 0/1-polytopes