References

  1. Bondarenko I.V. Growth of Schreier graphs of automaton groups. Math. Ann. 2012, 354 (2), 765-785. doi: 10.1007/s00208-011-0757-x
  2. Diekert V., Myasnikov A.G., Weis A. Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem. In: Linton S., Robertz D., Yokoyama K. (Eds.) Proc. of the Intern. Conf. "2015 ACM on International Symposium on Symbolic and Algebraic Computation". Bath, United Kingdom, ACM, USA, 2015. 141-148.
  3. Fedorova M.V. Free products of finite groups generated by finite automata. Naukovi zapysky NaUKMA. Phys.-Math. Sci. 2014, 152, 48-51. (in Ukrainian)
  4. Grigorchuk R., Leemann P.H., Nagnibeda T. Lamplighter groups, de Bruijn graphs, spider-web graphs and their spectra. J. Phys. A 2016, 49 (20), 205004. doi: 10.1088/1751-8113/49/20/205004
  5. Malicet D., Mann K., Rivas C., Triestino M. Ping-pong configurations and circular orders on free groups. arXiv preprint. arXiv:1709.02348
  6. Oliinyk A.S. Free products of finite groups and groups of finitely automatic permutations. Tr. Mat. Inst. Steklova 2000, 231, 323-331. (in Russian)
  7. Olijnyk A., Sushchansky V. Representations of free products by infinite unitriangular matrices over finite fields. Internat. J. Algebra Comput. 2004, 14 (05n06), 741-749. doi: 10.1142/S0218196704001931
  8. Schreier O. Die untergruppen der freien gruppen. Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg 1927, 5 (1), 161-183. (in German)

Refbacks

  • There are currently no refbacks.


Creative Commons License
The journal is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported.