Related papers: More on Groups and Counter Automata

We show that for any finitely generated subgroup $H$ of a limit group $L$ there exists a finite-index subgroup $K$ containing $H$, such that $K$ is a subgroup of a group obtained from $H$ by a series of extensions of centralizers and free…

Let N be a normal subgroup of a finite group G. We prove that under certain (unavoidable) conditions the subgroup [N,G] is a product of commutators [N,y] (with prescribed values of y from a given set Y) of length bounded by a function of…

The article presents several methods for the arithmetic of finite abelian groups. We introduce a tool - already used by Delsarte in [1] as I found out later - analogous to Dirichlet's convolution to obtain combinatorial results on these…

We construct finitely generated torsion-free solvable groups $G$ that have infinite rank, but such that all finitely generated torsion-free metabelian subquotients of $G$ are virtually abelian. In particular all finitely generated…

In this short note we prove that a graph product $G_\Gamma$ of finitely generated abelian groups is semicomplete -- that is the kernel of the natural homomorphism ${\rm Aut}(G_\Gamma)\to{\rm Aut}(G_\Gamma^{ab})$ induced by the…

We provide an algorithm to solve the word problem in all fundamental groups of closed 3-manifolds; in particular, we show that these groups are autostackable. This provides a common framework for a solution to the word problem in any closed…

We introduce a new tool, called the orbit automaton, that describes the action of an automaton group $G$ on the subtrees corresponding to the orbits of $G$ on levels of the tree. The connection between $G$ and the groups generated by the…

We construct, for the first time, various types of specific non-special finite $p$-groups having abelian automorphism group. More specifically, we construct groups $G$ with abelian automorphism group such that $\gamma_2(G) < \mathrm{Z}(G) <…

We show that the epimorphism problem is solvable for targets that are virtually cyclic or a product of an Abelian group and a finite group.

The idempotent problem of a finitely generated inverse semigroup is the formal language of all words over the generators representing idempotent elements. This note proves that a finitely generated inverse semigroup with regular idempotent…

Let $1 \to N \to G \to H \to 1$ be an abelian extension. The purpose of this paper is to study the problem of extending automorphisms of $N$ and lifting automorphisms of $H$ to certain automorphisms of $G$.

It is shown that certain ascending HNN extensions of free abelian groups of finite rank, as well as various lamplighter groups, can be realized as automaton groups, i.e., can be given a self-similar structure. This includes the solvable…

We obtain an explicit description of the endomorphisms of free-abelian by free groups together with a characterization of when they are injective and surjective. As a consequence we see that free-abelian by free groups are Hopfian and not…

We show that the group of bounded automatic automorphisms of a rooted tree is amenable, which implies amenability of numerous classes of groups generated by finite automata. The proof is based on reducing the problem to showing amenability…

Previously the second author has constructed by cobordism methods, an invariant associated to a finite group $G$. This invariant approximates the number of subgroups of a group, giving in some cases the number of abelian and cyclic…

For every finite abelian group $A$ and $n\geq 3$, we construct a finitely presented group defined by explicit generators and relations, such that its center is $\pi_n(\Sigma K(A,1))$.

We describe structure of quasihomomorphisms from arbitrary groups to discrete groups. We show that all quasihomomorphisms are 'constructible', i.e., are obtained via certain natural operations from homomorphisms to some groups and…

Baer characterized capable finite abelian groups (a group is capable if it is isomorphic to the quotient of some group by its center) by a condition on the size of the factors in the invariant factor decomposition (the group must be…

It has been shown by Lubotzky in [10] that the set of verbal images of a fixed non-abelian finite simple group G is precisely the set of endomorphism invariant subsets of G. Here we use his result to determine the verbal images of certain…

We consider decidability problems in self-similar semigroups, and in particular in semigroups of automatic transformations of $X^*$. We describe algorithms answering the word problem, and bound its complexity under some additional…