Related papers: A note on doubles of groups

The probabilistic Waring problem for finite simple groups asks whether every word of the form $w_1w_2$, where $w_1$ and $w_2$ are non-trivial words in disjoint sets of variables, induces almost uniform distribution on finite simple groups…

Counterexamples to the Modular Isomorphism Problem were discovered recently. These are non-isomorphic finite $2$-groups $G$ and $H$ that have isomorphic group algebras over the field $\mathbb{Z}/2\mathbb{Z}$ and non-isomorphic group…

In this article we study a class of central extensions of $\mathbb{Z}\wr\mathbb{Z}$, as first described by Hall. On the one hand, we consider groups of this type with cyclic centre, our construction yields a rich class of groups. In…

In this article new cases of the Inverse Galois Problem are established. The main result is that for a fixed integer n, there is a positive density set of primes p such that PSL_2(F_{p^n}) occurs as the Galois group of some finite extension…

We prove that every finitely generated residually finite group $G$ can be embedded in a finitely generated branch group $\Gamma$ such that two elements in $G$ are conjugate in $G$ if and only if they are conjugate in $\Gamma$. As an…

The first-order theory of the automorphism group of an infinite resplendent model in a finite language is undecidable.

We present two uncountable families of finitely generated residually finite groups all having the same profinite completion. One consists of soluble groups, the other of branch groups.

We investigate the possible structures imposed on a finite group by its possession of an automorphism sending a large fraction of the group elements to their cubes, the philosophy being that this should force the group to be, in some sense,…

The co-word problem of a group G generated by a set X is defined as the set of words in X which do not represent 1 in G. We introduce a new method to decide if a permutation group has context-free co-word problem. We use this method to…

In this paper we study the residual solvability of the generalized free product of finitely generated nilpotent groups. We show that these kinds of structures are often residually solvable.

We study verbally closed subgroups of free solvable groups. A number of results is proved that give sufficient conditions under whose a verbally closed subgroup is turned to be a retract and so algebraically closed of the full group.

We consider pairs of finitely presented, residually finite groups $P\hookrightarrow\G$ for which the induced map of profinite completions $\hat P\to \hat\G$ is an isomorphism. We prove that there is no algorithm that, given an arbitrary…

We study membership problems in HNN extensions of free groups and then apply these results to solve the word problem in certain families of one-relator inverse monoids. In more detail, we consider HNN extensions where the defining…

We construct an extension $E(A,G)$ of a given group $G$ by infinite non-Archimedean words over an discretely ordered abelian group like $Z^n$. This yields an effective and uniform method to study various groups that "behave like $G$". We…

For the free group $F_r$ on $r>1$ generators (respectively, the free product $G_1 * G_2$ of two nontrivial finite groups $G_1$ and $G_2$), we obtain the asymptotic for the number of conjugacy classes of commutators in $F_r$ (respectively,…

We construct words with small image in a given finite alternating or unimodular group. This shows that word width in these groups is unbounded in general.

We investigate which free constructions (amalgamated products and HNN-extensions) over word hyperbolic groups produce groups that are again word hyperbolic. A complete answer is obtained for the case when the amalgamated subgroups are…

We show that for any countable group $ G $ equipped with a probability measure $ \mu $, there exists a randomized stopping time $ \tau $ such that $ (G, \mu _{\tau} )$ admits a strictly larger space of bounded harmonic functions than $…

We show that on an arbitrary finitely generated non virtually solvable linear group, any two independent random walks will eventually generate a free subgroup. In fact, this will hold for an exponential number of independent random walks.

This paper studies a subset of the free semi-group $F_k$ with letters in a field $k$ which has some interesting arithmetic and combinatorial properties.