Mathematics of Constraint Satisfaction Problems

Schedule

9:00 Opening
9:30 Libor Barto — Toward The Algorithm
10:30 coffee break
11:00 Demian Banakh — Analytical approach to Boolean PCSPs
11:30 Tamio-Vesa Nakajima — Towards infinite PCSP: a dichotomy for monochromatic cliques
12:00 lunch
13:00–15:00 Discussions
15:00 coffee break
15:30 Alberto Larrauri — PCSP Algorithms: Rounding and Meta-Problems
16:30 Venkatesan Guruswami — Redundancy is all you need (for CSP sparsification)
17:00 Victor Lagerkvist — The Richness of CSP Non-redundancy

9:00 Michael Kompatscher — Minimal Mal'cev clones
9:30 Dmitriy Zhuk — How to find a symmetric object in an ugly minion
10:00 Max Hadek — Hierarchies galore
10:30 coffee break
11:00 Tomáš Jakl — The rabbit hole of adjunctions
12:00 lunch
13:00–15:00 Discussions / Task Force on Topological Methods (MCS 2051)
15:00 coffee break
15:30 Christoph Spiess — Everything is a cheese (From infinite CSPs to finite PCSPs)
16:00 Jakub Rydval — The Polynomial Hierarchy and ω-categorical CSPs
16:30 Žaneta Semanišinová — A Preservation Theorem for Valued Structures
18:00– banquet

9:00–10:30 Lorenzo Ciardo — The complexity of quantum constraint satisfaction
10:00 Andrei Bulatov — Satisfiability of commutative vs. non-commutative CSPs
10:30 coffee break
11:00 Johan Håstad — Some (mostly old) results on approximability
12:00 lunch
13:00–15:00 Discussions
15:00 coffee break
15:30– free time / walk

9:00 Amey Bhangale — On Approximability of Satisfiable CSPs & Applications
10:00 Neng Huang — On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems
10:30 coffee break
11:00–12:00 Discussions / Task Force on Categorical Methods (MCS 2051)
12:00 lunch
13:00–15:00 Discussions / Task Force on the power of $k$-th level of $\mathbb Z_p$ (MCS 2051)
15:00 coffee break
15:30 Magnus Wahlström — FPT-approximation of MinCSPs: A progress report
16:30 Libor Barto — Toward The Algorithm, part 2

9:00–10:30 Moritz Albert Schöbi — Troublemakers in the infinite: directed graph colouring in temporal and phylogeny constraint languages
9:30 Michał Wrona — Constraint Satisfaction Problems over Finitely Bounded Homogeneous Structures: a Dichotomy between FO and L-hard
10:00 Michael Pinsker — Decidability of interpretability
10:30 coffee break
11:00–12:00 Bertalan Bodor — Promise compactness and promise CSPs
12:00 lunch