The group of asynchronus rational automata is simple but not finitely generated

Thumbnail

Event details

Date 04.10.2018
Hour 15:0016:00
Speaker James Hyde, St. Andrews
Location
Category Conferences - Seminars

The group R of asynchronus rational automata was introduced by Grigorchuk, Nekrashevych, and Sushchanskii in 2000. Jim Belk, Francesco Matucci and myself show in a joint paper that R is simple but not finitely generated. I will define R and sketch the proofs of these two results.

Practical information

  • Expert
  • Free

Event broadcasted in

Share