Date: Tue, Nov 21, 2017
Time: 17:10 - 18:10
Venue: Middle Meeting Room
Title: Foldings of De Bruijn graphs
De Bruijn graphs were introduced for the construction of universal cycles over a given finite alphabet, cycles with the property that every $k$-tuple of symbols occurs just once in the cycle. After discussing a related question, still unsolved, I will consider De Bruijn graphs as automata defining homeomorphisms of Cantor space, and their connection with objects such as Thompson's group V and its generalisations, and endomorphisms of the shift dynamical system.
Slides: View slides