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

Davis, N; Elder, M; Reeves, L

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

Davis, N Elder, M

Reeves, L

Permalink

Publication Type:: Journal Article
Citation:: Algebra and Discrete Mathematics, 2014, 17 (1), pp. 20 - 32
Issue Date:: 2014-01-01

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Published VersionAdobe PDF (140.24 kB)

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Davis, N	en_US
dc.contributor.author	Elder, M https://orcid.org/0000-0002-2438-3945	en_US
dc.contributor.author	Reeves, L	en_US
dc.date.issued	2014-01-01	en_US
dc.identifier.citation	Algebra and Discrete Mathematics, 2014, 17 (1), pp. 20 - 32	en_US
dc.identifier.issn	1726-3255	en_US
dc.identifier.uri	http://hdl.handle.net/10453/97348
dc.description.abstract	© Journal Algebra and Discrete Mathematics. 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.	en_US
dc.relation.ispartof	Algebra and Discrete Mathematics	en_US
dc.title	Non-contracting groups generated by (3,2)-automata	en_US
dc.type	Journal Article
utslib.citation.volume	1	en_US
utslib.citation.volume	17	en_US
utslib.for	0101 Pure Mathematics	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Science
pubs.organisational-group	/University of Technology Sydney/Faculty of Science/School of Mathematical and Physical Sciences
utslib.copyright.status	open_access
pubs.issue	1	en_US
pubs.publication-status	Published	en_US
pubs.volume	17	en_US

Abstract:

© Journal Algebra and Discrete Mathematics. 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.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/97348