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...

Повний опис

Збережено в:
Бібліографічні деталі
Дата:2018
Автори: Davis, Nick, Elder, Murray, Reeves, Lawrence
Формат: Стаття
Мова:English
Опубліковано: Lugansk National Taras Shevchenko University 2018
Теми:
Онлайн доступ:https://admjournal.luguniv.edu.ua/index.php/adm/article/view/1022
Теги: Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
Назва журналу:Algebra and Discrete Mathematics

Репозитарії

Algebra and Discrete Mathematics
id admjournalluguniveduua-article-1022
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
institution Algebra and Discrete Mathematics
baseUrl_str
datestamp_date 2018-04-26T01:41:11Z
collection OJS
language English
topic automaton group
self-similar group
contracting action
self-similarity graph
20E08
20F65
68Q45
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
topic_facet automaton group
self-similar group
contracting action
self-similarity graph
20E08
20F65
68Q45
format Article
author Davis, Nick
Elder, Murray
Reeves, Lawrence
author_facet Davis, Nick
Elder, Murray
Reeves, Lawrence
author_sort Davis, Nick
title Non-contracting groups generated by (3,2)-automata
title_short 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_sort non-contracting groups generated by (3,2)-automata
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.
publisher Lugansk National Taras Shevchenko University
publishDate 2018
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
first_indexed 2025-12-02T15:38:07Z
last_indexed 2025-12-02T15:38:07Z
_version_ 1850411463423819776