Hostname: page-component-7b7567c8c-w7t8q Total loading time: 0 Render date: 2026-11-18T22:20:41.290Z Has data issue: false hasContentIssue false

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

Published online by Cambridge University Press:  13 April 2021

DMITRY BERDINSKY
Affiliation:
Department of Mathematics, Faculty of Science, Mahidol University, Bangkok 10400, Thailand and Centre of Excellence in Mathematics, Commission on Higher Education, Bangkok 10400, Thailand e-mail: berdinsky@gmail.com
MURRAY ELDER*
Affiliation:
School of Mathematical and Physical Sciences, University of Technology Sydney, Ultimo, NSW 2007, Australia
JENNIFER TABACK
Affiliation:
Department of Mathematics, Bowdoin College, 8600 College Station, Brunswick, ME 04011, USA e-mail: jtaback@bowdoin.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We extend work of Berdinsky and Khoussainov [‘Cayley automatic representations of wreath products’, International Journal of Foundations of Computer Science 27(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.

Information

Type
Research Article
Copyright
© 2021 Australian Mathematical Publishing Association Inc.