Here I will post some papers that are suggested for the end of semester presentations.
- Saul Schleimer. Polynomial-time word problems, arXiv. One can restrict attention to the proof of Theorem 5.2.
- Show that every (2k)-regular (possibly infinite) connected graph is a Schreier graph of a free group of rank k
- J.W. Cannon, W.J. Floyd, W.R. Parry. Introductory notes on Richard Thompson's groups, link
- Coset enumeration algorithm, the description is in Rotman's book
- R. Hartung, Algorithms for finitely L-presented groups and applications to some self-similar groups
- H. Matui, Some remarks on topological full groups of Cantor minimal systems
- R. Grigorchuk, K. Medynets, Presentations of Topological Full Groups by Generators and Relations
- Pierre Gillibert. The finiteness problem for automaton semigroups is undecidable, arXiv
- Will Dison, Tim Riley. Hydra groups, arXiv
- Rostislav Grigorchuk, Zoran Sunik. Asymptotic aspects of Schreier graphs and Hanoi Towers groups, arXiv
- Benson Farb. Automatic Groups: A Guided Tour, PS
- Jose Burillo, Murray Elder. Metric properties of Baumslag-Solitar groups, arXiv
- Heather Armstrong, Bradley Forrest, Karen Vogtmann. A presentation for Aut(F_n), arXiv
- Ievgen Bondarenko, Tullio Ceccherini-Silberstein, Alfredo Donno, Volodymyr Nekrashevych. On a family of Schreier graphs of intermediate growth associated with a self-similar group, arXiv
- Susan Hermiller. Rewriting Systems for Coxeter Groups, link
- Introduction to Mapping Class Groups from Benson Farb, Dan Margalit. A Primer on Mapping Class Groups.
January 08th, 2018
Back to course page