Related papers: Infinite $\frac{3}{2}$-generated groups

A group $G$ is said to be totally $2$-closed if in each of its faithful permutation representations, say on a set $\Omega$, $G$ is the largest subgroup of $\mathrm{Sym}(\Omega)$ which leaves invariant each of the $G$-orbits for the induced…

We develop theorems which produce a multitude of hyperbolic triples for the finite classical groups. We apply these theorems to prove that every quasisimple group except Alt(5) and SL_2(5) is a Beauville group. In particular, we settle a…

We prove that there exists a group which is not finitely generated, but admits a minimal sofic shift. This answers a question of Doucha, Melleray and Tsankov. The group is of the form $(F_4 \times F_2) \rtimes F_{\infty}$. The construction…

Given a group $G$ acting faithfully on a set $S$, we characterize precisely when the twisted Brin-Thompson group $SV_G$ is finitely presented. The answer is that $SV_G$ is finitely presented if and only if we have the following: $G$ is…

Utilizing an embedding theorem of Obraztsov we construct groups as described in the title. This provides an affirmative answer to a problem of D. O. Revin. The constructed groups also provide a negative answer to a question highlighted by…

We consider generalisations of Thompson's group $V$, denoted by $V_r(\Sigma)$, which also include the groups of Higman, Stein and Brin. It was shown by the authors in [20] that under some mild conditions these groups and centralisers of…

We prove that the invariably generating graph of a finite group can have an arbitrarily large number of connected components with at least two vertices.

In this paper we show that there exists an uncountable family of finitely generated simple groups with the same positive theory as any non-abelian free group. In particular, these simple groups have infinite $w$-verbal width for all…

We complete the classification of the finite special linear groups $\SL_n(q)$ which are $(2,3)$-generated, i.e., which are generated by an involution and an element of order $3$. This also gives the classification of the finite simple…

There are several results in the literature concerning $p$-groups $G$ with a maximal elementary abelian normal subgroup of rank $k$ due to Thompson, Mann and others. Following an idea of Sambale we obtain bounds for the number of generators…

We prove two approximations of the open problem of whether the adjoint group of a non-nilpotent nil ring can be finitely generated: We show that the adjoint group of a non-nilpotent Jacobson radical cannot be boundedly generated, and on the…

Answering a question of Dan Haran and generalizing some results of Aschbacher-Guralnick and Suzuki, we prove that given a set of primes pi, any finite group can be generated by a pi-subgroup and a pi'-subgroup. This gives a free product…

We demonstrate the existence of a family of finitely generated subgroups of Richard Thompson's group $F$ which is strictly well-ordered by the embeddability relation in type $\epsilon_0 +1$. All except the maximum element of this family…

We develop methods to control the first-order theory of groups arising as certain direct limits of torsion-free hyperbolic groups, answering several questions in the literature. We construct simple torsion-free Tarski monsters $\Gamma$…

Motivated by Burillo, Cleary and Roever's summary on obstructions of subgroups of Thompson's group $V,$ we explored the higher dimensional version of the groups, Brin-Thompson groups $nV$ and $SV,$ a class of infinite dimensional…

In 2013, Kharlampovich, Myasnikov, and Sapir constructed the first examples of finitely presented residually finite groups with large Dehn functions. Given any recursive function $f$, they produce a finitely presented residually finite…

A finite group $G$ is \emph{coprimely-invariably generated} if there exists a set of generators $\{g_1, ..., g_u\}$ of $G$ with the property that the orders $|g_1|, ..., |g_u|$ are pairwise coprime and that for all $x_1, ..., x_u \in G$ the…

The sets of primitive, quasiprimitive, and innately transitive permutation groups may each be regarded as the building blocks of finite transitive permutation groups, and are analogues of composition factors for abstract finite groups. This…

We prove that every right-angled Coxeter group (RACG) is profinitely rigid amongst all Coxeter groups. On the other hand we exhibit RACGs which have infinite profinite genus amongst all finitely generated residually finite groups. We also…

We construct the first examples of an algorithmically complex finitely presented residually finite groups and first examples of finitely presented residually finite groups with arbitrarily large (recursive) Dehn function and depth function.…