Related papers: The Lamplighter Group is Not Semistable at Infinit…

Suppose that $G$ is a finite group and $H$ is a subgroup of $G$. We say that $H$ is s-semipermutable in $G$ if $HG_p = G_pH$ for any Sylow $p$-subgroup $G_p$ of $G$ with $(p, |H|) = 1$. We investigate the influence of s-semipermutable…

We describe the groups that have the same holomorph as a finite perfect group. Our results are complete for centerless groups. When the center is non-trivial, some questions remain open. The peculiarities of the general case are illustrated…

It is proven that if a finitely presented group is one ended it has asymptotic dimension bigger than one. It follows that finitely presented groups with asdim 1 are virtually free. A counterexample is given for the finitely generated case.

Pursueing our investigations on the relations between Thompson groups and mapping class groups, we introduce the group $T^*$ (and its further generalizations) which is an extension of the Ptolemy-Thompson group $T$ by means of the full…

It is known that in any free group the isolator of finitely generated subgroup is finitely generated subgroup. A very simple proof of this statement is proposed.

The structure of groups for which certain sets of commutator subgroups are finite is investigated, with a particular focus on the relationship between these groups and those with finite derived subgroup.

A subset $A$ of a semigroup $S$ is called a $chain$ ($antichain$) if $xy\in\{x,y\}$ ($xy\notin\{x,y\}$) for any (distinct) elements $x,y\in S$. A semigroup $S$ is called ($anti$)$chain$-$finite$ if $S$ contains no infinite (anti)chains. We…

We prove that every finitely generated soluble group which is not virtually abelian has a subgroup of one of a small number of types.

The finiteness problem for automaton groups and semigroups has been widely studied, several partial positive results are known. However we prove that, in the most general case, the problem is undecidable. We study the case of automaton…

A permutoid is a set of partial permutations that contains the identity and is such that partial compositions, when defined, have at most one extension in the set. In 2004 Peter Cameron conjectured that there can exist no algorithm that…

We study the realization problem of finite groups as the group of homotopy classes of self-homotopy equivalences of finite spaces. Let $G$ be a finite group. Using an infinite family of pairwise non weakly homotopic asymmetric spaces we…

Let $\G$ be a limit group, $S\subset\G$ a subgroup, and $N$ the normaliser of $S$. If $H_1(S,\mathbb Q)$ has finite $\Q$-dimension, then $S$ is finitely generated and either $N/S$ is finite or $N$ is abelian. This result has applications to…

We prove that every finitely generated, residually finite group $G$ embeds into a finitely generated perfect branch group $\Gamma$ such that many properties of $G$ are preserved under this embedding. Among those are the properties of being…

For a variety of finite groups $\mathbf H$, let $\overline{\mathbf H}$ denote the variety of finite semigroups all of whose subgroups lie in $\mathbf H$. We give a characterization of the subsets of a finite semigroup that are pointlike…

We describe an algorithm that computes the index of a finitely generated subgroup in a finitely $L$-presented group provided that this index is finite. This algorithm shows that the subgroup membership problem for finite index subgroups in…

We construct examples of finitely generated decidable group presentations that satisfy certain combinations of solvability for the word problem, solvability for the bounded word problem, and computablity for the Dehn function. We prove that…

In this note we study the finite groups whose subgroup lattices are dismantlable.

The authors classify the finite index subgroups of R. Thompson's group $F$. All such groups that are not isomorphic to $F$ are non-split extensions of finite cyclic groups by $F$. The classification describes precisely which finite index…

We address the question: for which collections of finite simple groups does there exist an algorithm that determines the images of an arbitrary finitely presented group that lie in the collection? We prove both positive and negative…

Let $G$ be a finitely generated group. We prove that the $n$-fold tensor product $G^{\otimes n}$ is finite (resp. polycyclic) if and only $G$ is finite (resp. polycyclic). Further, assuming that $G$ is finitely presented, we show that…