On the geometry of Cayley automatic groups
DOI10.1142/S0218196722500199OpenAlexW3137103077MaRDI QIDQ5075699FDOQ5075699
Authors: D. A. Berdinskij, Jennifer Taback, Murray Elder
Publication date: 11 May 2022
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.02381
Recommendations
- From automatic structures to automatic groups.
- Towards quantitative classification of Cayley automatic groups
- Cayley graph automatic groups are not necessarily Cayley graph biautomatic
- Cayley automatic groups and numerical characteristics of Turing transducers
- Measuring closeness between Cayley automatic groups and automatic groups
Formal languages and automata (68Q45) Extensions, wreath products, and other compositions of groups (20E22) Geometric group theory (20F65) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- From automatic structures to automatic groups.
- On automatic transitive graphs
- \(\mathcal C\)-graph automatic groups.
- Horocyclic products of trees
- Groups with undecidable word problem and almost quadratic Dehn function. (With an appendix written by M. V. Sapir)
- Groups of intermediate growth: an introduction.
- Wreath products and finitely presented groups
- An isoperimetric inequality for the Heisenberg groups
- Quadratic isometric functions of the Heisenberg groups. A combinatorial proof
- A short proof that a subquadratic isoperimetric inequality implies a linear one
- Finite presentations of infinite structures: Automata and interpretations
- HYPERBOLICITY OF GROUPS WITH SUBQUADRATIC ISOPERIMETRIC INEQUALITY
- Title not available (Why is that?)
- GROUPS WITH QUADRATIC-NON-QUADRATIC DEHN FUNCTIONS
- The Dehn function of Stallings' group.
- Conjugacy problem in groups with quadratic Dehn function
- Measuring closeness between Cayley automatic groups and automatic groups
- Higher rank lamplighter groups are graph automatic
- Cayley automatic representations of wreath products
- BEING CAYLEY AUTOMATIC IS CLOSED UNDER TAKING WREATH PRODUCT WITH VIRTUALLY CYCLIC GROUPS
- The Dehn functions of Stallings-Bieri groups
Cited In (4)
This page was built for publication: On the geometry of Cayley automatic groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075699)