Combinatorial models of expanding dynamical systems

We define iterated monodromy groups of more general structures than partial self-covering. This generalization makes it possible to define a natural notion of a combinatorial model of an expanding dynamical system. We prove that a naturally defined "Julia set" of the generalized dynamical systems depends only on the associated iterated monodromy group. We show then that the Julia set of every expanding dynamical system is an inverse limit of simplicial complexes constructed by inductive cut-and-paste rules.Comment: The new version differs substantially from the first one. Many parts are moved to other (mostly future) papers, the main open question of the first version is solve

On abstract commensurators of groups

We prove that the abstract commensurator of a nonabelian free group, an infinite surface group, or more generally of a group that splits appropriately over a cyclic subgroup, is not finitely generated. This applies in particular to all torsion-free word-hyperbolic groups with infinite outer automorphism group and abelianization of rank at least 2. We also construct a finitely generated, torsion-free group which can be mapped onto Z and which has a finitely generated commensurator.Comment: 13 pages, no figur

A defining property of virtually nilpotent groups, Publ

Abstract. We answer the question: which property distinguishes the virtually nilpotent groups among the locally graded groups? The common property of each finitely generated group to have a finitely generated commutator subgroup is not sufficient. However, the finitely generated commutator subgroup of F2(var G), a free group of rank 2 in the variety defined by G, is the necessary and sufficient condition

On the Finiteness Problem for Automaton (Semi)groups

This paper addresses a decision problem highlighted by Grigorchuk, Nekrashevich, and Sushchanskii, namely the finiteness problem for automaton (semi)groups. For semigroups, we give an effective sufficient but not necessary condition for finiteness and, for groups, an effective necessary but not sufficient condition. The efficiency of the new criteria is demonstrated by testing all Mealy automata with small stateset and alphabet. Finally, for groups, we provide a necessary and sufficient condition that does not directly lead to a decision procedure

On non-Hopfian groups of fractions

The group of fractions of a semigroup S, if exists, can be written as G = SS−1. If S is abelian, then G must be abelian. We say that a semigroup identity is transferable if being satisfied in S it must be satisfied in G = SS−1. One of problems posed by G.Bergman in 1981 asks whether the group G must satisfy every semigroup identity which is satisfied in S, that is whether every semigroup identity is transferable. The first non-transferable identities were constructed in 2005 by S.V.Ivanov and A.M. Storozhev

.

The article contains no abstrac

On the coincidence of verbal products

The article contains no abstrac