11 citations · 12 across the 5 of their papers we have counts for
5 papers
Ramanujan subshifts
Ievgen Bondarenko, Rostislav Grigorchuk, Alina Vdovina
A finite, connected, -regular graph is called Ramanujan if every its eigenvalue satisfies either or . The Ramanujan condition corres…
The word problem and growth of groups
Ievgen Bondarenko
Let denote the word problem in a finitely generated group . We consider the complexity of with respect to standard deterministic Turing machines.…
The zero divisor conjecture and Mealy automata
Ievgen Bondarenko, Kate Juschenko
The zero divisor conjecture is sufficient to prove for certain class of finitely presented groups where the relations are given by a pairing of generators. We associate Mealy autom…
Quaternionic lattices and poly-context-free word problem
Ievgen Bondarenko
A finitely generated group is called poly-context-free if its word problem is an intersection of finitely many context-free languages. We consider the quaterni…
On Sushchansky p-groups
Ievgen Bondarenko, Dmytro Savchuk
We study Sushchansky p-groups. We recall the original definition and translate it into the language of automata groups. The original actions of Sushchansky groups on p-ary tree are…