BEING CAYLEY AUTOMATIC IS CLOSED UNDER TAKING WREATH PRODUCT WITH VIRTUALLY CYCLIC GROUPS

BERDINSKY, D; ELDER, M; TABACK, J

BEING CAYLEY AUTOMATIC IS CLOSED UNDER TAKING WREATH PRODUCT WITH VIRTUALLY CYCLIC GROUPS

BERDINSKY, D ELDER, M TABACK, J

Permalink

Publisher:: Cambridge University Press (CUP)
Publication Type:: Journal Article
Citation:: Bulletin of the Australian Mathematical Society, 2021, pp. 1-11
Issue Date:: 2021-04-13

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

The embargo period expires on 31 Oct 2021

Adobe PDF

Download Accepted versionAdobe PDF (155.25 kB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	BERDINSKY, D
dc.contributor.author	ELDER, M
dc.contributor.author	TABACK, J
dc.date.accessioned	2021-05-04T07:17:08Z
dc.date.available	2021-05-04T07:17:08Z
dc.date.issued	2021-04-13
dc.identifier.citation	Bulletin of the Australian Mathematical Society, 2021, pp. 1-11
dc.identifier.issn	0004-9727
dc.identifier.issn	1755-1633
dc.identifier.uri	http://hdl.handle.net/10453/148612
dc.description.abstract	<jats:title>Abstract</jats:title> <jats:p>We extend work of Berdinsky and Khoussainov [‘Cayley automatic representations of wreath products’, <jats:italic>International Journal of Foundations of Computer Science</jats:italic><jats:bold>27</jats:bold>(2) (2016), 147–159] to show that being Cayley automatic is closed under taking the restricted wreath product with a virtually infinite cyclic group. This adds to the list of known examples of Cayley automatic groups.</jats:p>
dc.language	en
dc.publisher	Cambridge University Press (CUP)
dc.relation.ispartof	Bulletin of the Australian Mathematical Society
dc.relation.isbasedon	10.1017/s000497272100023x
dc.rights	info:eu-repo/semantics/embargoedAccess
dc.subject	0101 Pure Mathematics
dc.subject.classification	General Mathematics
dc.title	BEING CAYLEY AUTOMATIC IS CLOSED UNDER TAKING WREATH PRODUCT WITH VIRTUALLY CYCLIC GROUPS
dc.type	Journal Article
utslib.for	0101 Pure Mathematics
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	*
utslib.copyright.embargo	2021-10-31T00:00:00+1000Z
dc.date.updated	2021-05-04T07:17:07Z
pubs.publication-status	Published online

Abstract:

Abstract We extend work of Berdinsky and Khoussainov [‘Cayley automatic representations of wreath products’, International Journal of Foundations of Computer Science27(2) (2016), 147–159] to show that being Cayley automatic is closed under taking the restricted wreath product with a virtually infinite cyclic group. This adds to the list of known examples of Cayley automatic groups.

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

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