Here I will post some papers that are suggested for the end of semester presentations.

1. Saul Schleimer. Polynomial-time word problems, arXiv. One can restrict attention to the proof of Theorem 5.2.
2. Show that every (2k)-regular (possibly infinite) connected graph is a Schreier graph of a free group of rank k
3. J.W. Cannon, W.J. Floyd, W.R. Parry. Introductory notes on Richard Thompson's groups, link
4. Coset enumeration algorithm, the description is in Rotman's book
5. R. Hartung, Algorithms for finitely L-presented groups and applications to some self-similar groups
6. H. Matui, Some remarks on topological full groups of Cantor minimal systems
7. R. Grigorchuk, K. Medynets, Presentations of Topological Full Groups by Generators and Relations
8. Pierre Gillibert. The finiteness problem for automaton semigroups is undecidable, arXiv
9. Will Dison, Tim Riley. Hydra groups, arXiv
10. Rostislav Grigorchuk, Zoran Sunik. Asymptotic aspects of Schreier graphs and Hanoi Towers groups, arXiv
11. Benson Farb. Automatic Groups: A Guided Tour, PS
12. Jose Burillo, Murray Elder. Metric properties of Baumslag-Solitar groups, arXiv
13. Heather Armstrong, Bradley Forrest, Karen Vogtmann. A presentation for Aut(F_n), arXiv
14. 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
15. Susan Hermiller. Rewriting Systems for Coxeter Groups, link
16. Introduction to Mapping Class Groups from Benson Farb, Dan Margalit. A Primer on Mapping Class Groups.

Updated: January 08th, 2018

Back to course page