activity
20062019
most citedClassification of groups generated by 3-state automata over a 2-letter alphabet

33 citations · 87 across the 16 of their papers we have counts for

collaborators

19 papers

math.GR2019★ 3 cited

On Orbits and the Finiteness of Bounded Automaton Groups

Ievgen Bondarenko, Jan Philipp Wächter

We devise an algorithm which, given a bounded automaton A, decides whether the group generated by A is finite. The solution comes from a description of the infinite sequences havin…

math.GR2017

Automaton groups and complete square complexes

Ievgen Bondarenko, Bohdan Kivva

The first example of a non-residually finite group in the classes of finitely presented small-cancelation groups, automatic groups, and CAT(0) groups was constructed by Wise as the…

math.GR2016★ 8 cited

Ends of Schreier graphs and cut-points of limit spaces of self-similar groups

Ievgen Bondarenko, Daniele D'Angeli, Tatiana Nagnibeda

Every self-similar group acts on the space of infinite words over some alphabet . We study the Schreier graphs for of the action of self-similar groups ge…

math.GR2015★ 2 cited

The lamplighter group generated by a bireversible automaton

I. Bondarenko, D. D'Angeli, E. Rodaro

We construct a bireversible self-dual automaton with states over an alphabet with letters which generates the lamplighter group .

math.GR2014

On finite generation of self-similar groups of finite type

Ievgen V. Bondarenko, Igor O. Samoilovych

A self-similar group of finite type is the profinite group of all automorphisms of a regular rooted tree that locally around every vertex act as elements of a given finite group of…

math.GR2014★ 2 cited

The word problem in Hanoi Towers groups

Ievgen Bondarenko

We prove that elements of the Hanoi Towers groups have depth bounded from above by a poly-logarithmic function , where is the length of an elem…