Distance between walks on graphs
Speaker 
Nishant Chandgotia, Tel Aviv University


When 
Oct 19, 2016
from 02:30 PM to 03:30 PM 
Where  LH 006 
Add event to calendar 
vCal iCal 
Abstract: Let H be a finite connected undirected graph. The set of all biinfinite walks on H, (x_i)_{i\in Z} can also be given a graph structure: We say (x_i)_{i\in Z} is adjacent to (y_i)_{i \in \Z} if x_i is adjacent to y_i for all i \in Z. Call this auxiliary graph H_{walk}. In this talk we will explore when and when not H_{walk} has finite diameter; time permitting, we will hint at its connections with symbolic dynamics and the undecidability of the word problem.