|
Organizers |
Hanoi Tower Groups and Schreier Graphs
by
Rostislav Grigorchuk
Texas A&M Univeristy
Coauthors: Zoran Sunik
We will associate with a famous puzzle known as Hanoi Tower Game on k-pegs a group which plays a role of the renorm group for this game. Some properties of Hanoi groups will be discussed including generation by a finite automaton and branching. A spectral properties of the Schreier graph in case of three pegs will be described as well.
Paper reference: arXiv:math.GR/0601592
Date received: February 5, 2006
Copyright © 2006 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # caqu-24.