Automaton groups and complete square complexes

被引:4
|
作者
Bondarenko, Ievgen [1 ]
Kivva, Bohdan [2 ]
机构
[1] Natl Taras Shevchenko Univ Kyiv, Mech & Math Fac, Vul Volodymyrska 64, UA-01033 Kiev, Ukraine
[2] Univ Chicago, Dept Math, 5734 S Univ Ave, Chicago, IL 60637 USA
关键词
Square complex; bireversible automaton; residual finiteness; automaton group; PRODUCTS; LATTICES;
D O I
10.4171/GGD/649
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The first example of a non-residually finite group in the classes of finitely presented small-cancelation groups, automatic groups, and CAT(0) groups was constructed by Wise as the fundamental group of a complete square complex (CSC for short) with twelve squares. At the same time, Janzen and Wise proved that CSCs with at most three, five or seven squares have residually finite fundamental group. The smallest open cases were CSCs with four squares and directed VH complete we complexes with six squares. We prove that the CSC with four squares studied by Janzen and Wise has a non-residually finite fundamental group. For the class of complete directed VH complexes, we prove that there are exactly two complexes with six squares having a non-residually finite fundamental group. In particular, this positively answers to a question of Wise. Our approach relies on the connection between square complexes and automata discovered by Glasner and Mozes, where complete VH complexes with one vertex correspond to bireversible automata. We prove that the square complex associated to a bireversible automaton with two states or over the binary alphabet generating an infinite automaton group has a non-residually finite fundamental group. We describe automaton groups associated to CSCs with four squares and get two simple automaton representations of the free group F-2.
引用
收藏
页码:305 / 332
页数:28
相关论文
共 50 条
  • [21] Systems of generators of automaton permutations groups
    Sikora, VS
    Sushchanskii, VI
    CYBERNETICS AND SYSTEMS ANALYSIS, 2000, 36 (03) : 415 - 425
  • [22] Systems of the generating groups of automaton permutations
    Sikora, V.S.
    Sushchanskij, V.I.
    Kibernetika i Sistemnyj Analiz, 2000, (03): : 121 - 134
  • [23] Key agreement based on automaton groups
    Grigorchuk, Rostislav
    Grigoriev, Dima
    GROUPS COMPLEXITY CRYPTOLOGY, 2019, 11 (02) : 77 - 81
  • [24] Quotient-Complete Arc-Transitive Latin Square Graphs from Groups
    Carmen Amarra
    Graphs and Combinatorics, 2018, 34 : 1651 - 1669
  • [25] Quotient-Complete Arc-Transitive Latin Square Graphs from Groups
    Amarra, Carmen
    GRAPHS AND COMBINATORICS, 2018, 34 (06) : 1651 - 1669
  • [26] Amenability of linear-activity automaton groups
    Amir, Gideon
    Angel, Omer
    Virag, Balint
    JOURNAL OF THE EUROPEAN MATHEMATICAL SOCIETY, 2013, 15 (03) : 705 - 730
  • [27] Numerical upper bounds on growth of automaton groups
    Brieussel, Jeremie
    Godin, Thibault
    Mohammadi, Bijan
    INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 2022, 32 (01) : 159 - 191
  • [28] Freeness of automaton groups vs boundary dynamics
    D'Angeli, Daniele
    Rodaro, Emanuele
    JOURNAL OF ALGEBRA, 2016, 462 : 115 - 136
  • [29] Generic Properties in Some Classes of Automaton Groups
    Godin, Thibault
    CELLULAR AUTOMATA AND DISCRETE COMPLEX SYSTEMS (AUTOMATA 2019), 2019, 11525 : 91 - 103
  • [30] Boundary dynamics for bireversible and for contracting automaton groups
    D'Angeli, Daniele
    Godin, Thibault
    Klimann, Ines
    Picantin, Matthieu
    Rodaro, Emanuele
    INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 2020, 30 (02) : 431 - 449