Non-contracting groups generated by (3,2)-automata

We add to the classification of groups generated by 3-state automata over a 2-letter alphabet given by Bondarenko \( et \ al.\), by showing that a number of the groups in the classification are non-contracting. We show that the criterion we use to prove a self-similar action is non-contracting also...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Datum:2018
Hauptverfasser: Davis, Nick, Elder, Murray, Reeves, Lawrence
Format: Artikel
Sprache:Englisch
Veröffentlicht: Lugansk National Taras Shevchenko University 2018
Schlagworte:
Online Zugang:https://admjournal.luguniv.edu.ua/index.php/adm/article/view/1022
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Назва журналу:Algebra and Discrete Mathematics

Institution

Algebra and Discrete Mathematics
_version_ 1856543178192060416
author Davis, Nick
Elder, Murray
Reeves, Lawrence
author_facet Davis, Nick
Elder, Murray
Reeves, Lawrence
author_sort Davis, Nick
baseUrl_str
collection OJS
datestamp_date 2018-04-26T01:41:11Z
description We add to the classification of groups generated by 3-state automata over a 2-letter alphabet given by Bondarenko \( et \ al.\), by showing that a number of the groups in the classification are non-contracting. We show that the criterion we use to prove a self-similar action is non-contracting also implies that the associated self-similarity graph introduced by Nekrashevych is non-hyperbolic.
first_indexed 2025-12-02T15:38:07Z
format Article
id admjournalluguniveduua-article-1022
institution Algebra and Discrete Mathematics
language English
last_indexed 2025-12-02T15:38:07Z
publishDate 2018
publisher Lugansk National Taras Shevchenko University
record_format ojs
spelling admjournalluguniveduua-article-10222018-04-26T01:41:11Z Non-contracting groups generated by (3,2)-automata Davis, Nick Elder, Murray Reeves, Lawrence automaton group, self-similar group, contracting action, self-similarity graph 20E08, 20F65, 68Q45 We add to the classification of groups generated by 3-state automata over a 2-letter alphabet given by Bondarenko \( et \ al.\), by showing that a number of the groups in the classification are non-contracting. We show that the criterion we use to prove a self-similar action is non-contracting also implies that the associated self-similarity graph introduced by Nekrashevych is non-hyperbolic. Lugansk National Taras Shevchenko University 2018-04-26 Article Article Peer-reviewed Article application/pdf https://admjournal.luguniv.edu.ua/index.php/adm/article/view/1022 Algebra and Discrete Mathematics; Vol 17, No 1 (2014) 2415-721X 1726-3255 en https://admjournal.luguniv.edu.ua/index.php/adm/article/view/1022/546 Copyright (c) 2018 Algebra and Discrete Mathematics
spellingShingle automaton group
self-similar group
contracting action
self-similarity graph
20E08
20F65
68Q45
Davis, Nick
Elder, Murray
Reeves, Lawrence
Non-contracting groups generated by (3,2)-automata
title Non-contracting groups generated by (3,2)-automata
title_full Non-contracting groups generated by (3,2)-automata
title_fullStr Non-contracting groups generated by (3,2)-automata
title_full_unstemmed Non-contracting groups generated by (3,2)-automata
title_short Non-contracting groups generated by (3,2)-automata
title_sort non-contracting groups generated by (3,2)-automata
topic automaton group
self-similar group
contracting action
self-similarity graph
20E08
20F65
68Q45
topic_facet automaton group
self-similar group
contracting action
self-similarity graph
20E08
20F65
68Q45
url https://admjournal.luguniv.edu.ua/index.php/adm/article/view/1022
work_keys_str_mv AT davisnick noncontractinggroupsgeneratedby32automata
AT eldermurray noncontractinggroupsgeneratedby32automata
AT reeveslawrence noncontractinggroupsgeneratedby32automata