Searcharxiv⌕ Search

arXiv subjects

Dmytro Savchuk

Publications and source records attributed to Dmytro Savchuk.

25 records · Page 2Linked to original sources
arXiv2008

Some graphs related to Thompson's group F

The Schreier graphs of Thompson's group F with respect to the stabilizer of 1/2 and generators x_0 and x_1, and of its unitary representation in L_2([0,1]) induced by the standard action on the interval [0,1] are explicitly described. The coamenability of the stabilizers of any finite set of dyadic rational numbers is established. The induced subgraph of the right Cayley graph of the positive monoid of F containing all the vertices of the form x_nv, where n>=0 and v is any word over the alphabet {x_0, x_1}, is constructed. It is proved that the latter graph is non-amenable.

math.GR↗
arXiv2007

On Sushchansky p-groups

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 not level-transitive and we describe their orbit trees. This allows us to simplify the definition and prove that these groups admit faithful level-transitive actions on the same tree. Certain branch structures in their self-similar closures are established. We provide the connection with, so-called, G groups that shows that all Sushchansky groups have intermediate growth and allows to obtain an upper bound on their period growth functions.

math.GR↗
arXiv2007

The Spectral Problem, Substitutions and Iterated Monodromy

We provide a self-similar measure for the self-similar group $G$ acting faithfully on the binary rooted tree, defined as the iterated monodromy group of the quadratic polynomial $z^2+i$. We also provide an $L$-presentation for $G$ and calculations related to the spectrum of the Markov operator on the Schreier graph of the action of $G$ on the orbit of a point on the boundary of the binary rooted tree.

math.GR↗
arXiv2006

Groups generated by 3-state automata over a 2-letter alphabet, I

An approach to a classification of groups generated by 3-state automata over a 2-letter alphabet and the current progress in this direction are presented. Several results related to the whole class are formulated. In particular, all finite, abelian, and free groups are classified. In addition, we provide detailed information and complete proofs for several groups from the class, with the intention of showing the main methods and techniques used in the classification.

math.GR↗