BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CERN//INDICO//EN
BEGIN:VEVENT
SUMMARY:Dynamics of the product replacement algorithm
DTSTART:20251204T073000Z
DTEND:20251204T093000Z
DTSTAMP:20260522T062000Z
UID:indico-event-15078@indico.math.cnrs.fr
DESCRIPTION:Speakers: Serge Cantat (University of Rennes)\n\nChoose a comp
 act Lie group G\, say the group SOk\,  and an integer n > 2.We will be in
 terested in n-tuples (g1\,…\, gn) of elements in G and in the smallest c
 losed subgroup containing such a tuple. The product replacement algorithm 
 can be considered as a group action on Gn generated by the following simpl
 e moves:\n\npermuting the gi\,\nchanging one of them into its inverse\,\nc
 hanging some gj into gjgi with i distinct from j.\n\nSuch ``moves’’ do
  not change the group generated by (g1\,…\, gn). The problem is to descr
 ibe the orbits of the product replacement algorithm in Gn. I will describe
  this problem and explain some results that hold when n is large (based on
  a joint work with C. Dupont and F. Martin-Baillon).\nLINK FOR THE WEBINAR
 https://univ-grenoble-alpes-fr.zoom.us/j/96099208605?pwd=bmExUGlIdEFBeVdVR
 W8rOFJuWkRpdz09\n\nhttps://indico.math.cnrs.fr/event/15078/
LOCATION:Thursday 4 December 2025\, 4:30 PM - 6:30 PM (Korea)
URL:https://indico.math.cnrs.fr/event/15078/
END:VEVENT
END:VCALENDAR