Time: 9h30, Thursday, March 16, 2017
Location: Room 201, Institute of Mathematics, 18 Hoang Quoc Viet
Abtract: The constraint satisfaction problems (CSPs) on infinite domains are a new research direction that was pioneered by the works of Bodirsky and Pinsker. This research direction is a considerable generalization of CSPs on finite domains that are still an active area of computer science. The study has many interesting interactions with other fields of mathematics such as Ramsey theory, model theory, universal algebra, topology, etc. In this talk we introduce the problems and discuss some very recent results on the study.