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

Full description

Saved in:
Bibliographic Details
Published in:Algebra and Discrete Mathematics
Date:2014
Main Authors: Davis, N., Elder, M., Reeves, L.
Format: Article
Language:English
Published: Інститут прикладної математики і механіки НАН України 2014
Online Access:https://nasplib.isofts.kiev.ua/handle/123456789/152338
Tags: Add Tag
No Tags, Be the first to tag this record!
Journal Title:Digital Library of Periodicals of National Academy of Sciences of Ukraine
Cite this:Non-contracting groups generated by (3,2)-automata / N. Davis, M. Elder, L. Reeves // Algebra and Discrete Mathematics. — 2014. — Vol. 17, № 1. — С. 20–32. — Бібліогр.: 4 назв. — англ.

Institution

Digital Library of Periodicals of National Academy of Sciences of Ukraine
Description
Summary: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.
ISSN:1726-3255