7 citations · 26 across the 17 of their papers we have counts for
Showing 2020 · math.GRShow all
3 papers · 2 filters
math.GR2020★ 2 cited
Cayley Polynomial-Time Computable Groups
Dmitry Berdinsky, Murray Elder, Prohrak Kruengthomya
We propose a new generalisation of Cayley automatic groups, varying the time complexity of computing multiplication, and language complexity of the normal form representatives. We…
math.GR2020
On the geometry of Cayley automatic groups
Dmitry Berdinsky, Murray Elder, Jennifer Taback
In contrast to being automatic, being Cayley automatic \emph{a priori} has no geometric consequences. Specifically, Cayley graphs of automatic groups enjoy a fellow traveler proper…
math.GR2020★ 2 cited
Nonstandard Cayley automatic representations of fundamental groups
Dmitry Berdinsky, Prohrak Kruengthomya
We construct a new family of Cayley automatic representations of semidirect products for which none of the projections of the normal subgroup $\…