BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen - ECPv5.7.0//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen
X-ORIGINAL-URL:https://www.greyc.fr
X-WR-CALDESC:évènements pour GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20250330T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20251026T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20250429T104500
DTEND;TZID=Europe/Paris:20250429T114500
DTSTAMP:20260430T121532
CREATED:20250416T143759Z
LAST-MODIFIED:20250416T143759Z
UID:11826-1745923500-1745927100@www.greyc.fr
SUMMARY:Séminaire Algorithmique : Nicolas Bitar (LAMFA\, Univ. Picardie)\, « Subshifts of finite type and quasi-isometries beyond groups »
DESCRIPTION:In 1964\, R. Berger proved the existence of strongly aperiodic subshifts of finite type (SFT) on $\mathbb{Z}^2$\, and used them to prove the undecidability of the Domino Problem. With the goal of understanding what aspects of $\mathbb{Z}^2$ account for this result\, there has been an effort in recent years to characterize the groups with undecidable Domino Problem\, and groups that admit strongly aperiodic SFTs. A key result in this direction is a result by Cohen that states that both the decidability of the Domino Problem and the existence of strongly aperiodic SFTs are quasi-isometry invariants for finitely presented groups. In this talk\, I will explain how to generalize this result to new structures called blueprints. I will show how this generalizes results from the literature that use structures other than groups\, and use the result to show that the Domino Problem for multidimensional geometric tilings is undecidable.\n\nThis is joint work with Sebastián Barbieri.
URL:https://www.greyc.fr/event/seminaire-algorithmique-nicolas-bitar-lamfa-univ-picardie-subshifts-of-finite-type-and-quasi-isometries-beyond-groups/
LOCATION:Sciences 3- S3 351
CATEGORIES:Amacc,General,News,Séminaire Algo
END:VEVENT
END:VCALENDAR