Considering shift dynamical systems without indexing

Luke Elliott (University of St Andrews)

Thursday 3rd February 16:00-17:00 Maths 311B


I will give a breif introduction to subshifts of finite type defined by finite directed graphs. In particular I will mention a category of "digaphs and foldings" introduced by Jim Belk, Collin Bleak, and Peter Cameron which is useful for studying these systems. I will then discuss my recent work in building an analogous category in which isomorphisms don't necessarily preserve indexing and path length. This category gives us both more flexible notions of (strong) shift equivalence and a connection to automorphisms of Thompsons groups.

Add to your calendar

Download event information as iCalendar file (only this event)