activity
20052025
most citedCayley Polynomial-Time Computable Groups

2 citations · 5 across the 11 of their papers we have counts for

collaborators

15 papers

math.DG2025

On constant mean curvature surfaces in the Heisenberg group

Dmitry Berdinsky

We study constant mean curvature surfaces in the three-dimensional Heisenberg group. We prove that a constant mean curvature surface in a neighborhood of non-umbilic point is descr…

math.GR2024

Extending the Synchronous Fellow Traveler Property

Prohrak Kruengthomya, Dmitry Berdinsky

We introduce an extension of the fellow traveler property which allows fellow travelers to be at distance bounded from above by a function growing slower than any linear fun…

math.GR2023★ 1 cited

Cayley Linear-Time Computable Groups

Prohrak Kruengthomya, Dmitry Berdinsky

This paper looks at the class of groups admitting normal forms for which the right multiplication by a group element is computed in linear time on a multi-tape Turing machine. We s…

cs.FL2023

String Compression in FA-Presentable Structures

Dmitry Berdinsky, Sanjay Jain, Bakhadyr Khoussainov +1

We construct a FA-presentation of the structure for which a numerical characteristic defined as the maximum number $ψ…

cs.CG2021

Finite Automata Encoding Piecewise Polynomials

Dmitry Berdinsky, Prohrak Kruengthomya

Finite automata are used to encode geometric figures, functions and can be used for image compression and processing. The original approach is to represent each point of a figure i…

math.GR2021

Being Cayley automatic is closed under taking wreath product with virtually cyclic groups

Dmitry Berdinsky, Murray Elder, Jennifer Taback

We extend work of the first author and Khoussainov to show that being Cayley automatic is closed under taking the restricted wreath product with a virtually infinite cyclic group.…