Let $G$ be a finitely generated solvable-by-finite linear group. We present an algorithm to compute the torsion-free rank of $G$ and a bound on the Prüfer rank of $G$. This yields in turn an algorithm to decide whether a finitely generated subgroup of $G$ has finite index. The algorithms are implemented in MAGMA for groups over algebraic number fields.
The `upper rank' of a group is the supremum of the (Prüfer) ranks of its finite quotients, and for a prime $p$, the `upper $p$-rank' is the supremum of the sectional $p$-ranks of those quotients. The former is finite if and only if the latter are finitely bounded as $p$ ranges over all primes (a deep fact). Here we discuss the question: if the upper $p$-ranks of a finitely generated group $G$ are all finite, are they necessarily bounded? The case where $G$ is a soluble group is still an open problem.
We obtain sufficient criteria for endomorphisms of torsion-free nilpotent groups of finite rank to be automorphisms, by considering the induced maps on the torsion-free abelianisation and the centre. Whilst these results are known in the finitely generated case removing this assumption introduces several difficulties.
We show that if $w$ is a multilinear commutator word and $G$ a finite group in which every metanilpotent subgroup generated by $w$-values is of rank at most $r$, then the rank of the verbal subgroup $w(G)$ is bounded in terms of $r$ and $w$ only. In the case where $G$ is soluble we obtain a better result -- if $G$ is a finite soluble group in which every nilpotent subgroup generated by $w$-values is of rank at most $r$, then the rank of $w(G)$ is at most $r+1$.
It is proven that an infinite finitely generated group cannot be elementarily equivalent to an ultraproduct of finite groups of a given Prüfer rank. Furthermore, it is shown that an infinite finitely generated group of finite Prüfer rank is not pseudofinite.
We improve a result of Prokhorov and Shramov on the rank of finite $p$-subgroups of the birational automorphism group of a rationally connected variety. Known examples show that they are sharp in many cases.
In the paper we study finitely generated linear groups of finite rank which have faithful irreducible primitive representations over a field of characteristic zero. We prove that if an infinite finitely generated linear group $G$ of finite rank has a faithful irreducible primitive representation over a field of characteristic zero then the $FC$-center $Δ(G)$ of $G$ is infinite.
We show that the number of conjugacy classes of intersections $A\cap B^g$, for fixed finitely generated subgroups $A, B<F$ of a free group, is bounded above in terms of the ranks of $A$ and $B$; this confirms an intuition of Walter Neumann. This result was previously known only in the case where $A$ or $B$ is cyclic by the $w$-cycles theorem of Helfer and Wise and, independently, Louder and Wilton. In order to prove our main theorem, we introduce new results regarding the structure of fibre products of finite graphs. We work with a generalised definition of graph immersions so that our results…
We offer a criterion for showing that the automorphism group of an ultrahomogeneous structure is topologically 2-generated and even has a cyclically dense conjugacy class. We then show how finite topological rank of the automorphism group of an $ω$-categorical structure can go down to reducts. Together, those results prove that a large number of $ω$-categorical structures that appear in the literature have an automorphism group of finite topological rank. In fact, we are not aware of any $ω$-categorical structure to which they do not apply (assuming the automorphism group has no compact quotie…
Suppose, $G$ is a residually finite group of finite upper rank admitting an automorphism $φ$ with finite Reidemeister number $R(φ)$ (the number of $φ$-twisted conjugacy classes). We prove that such $G$ is soluble-by-finite (in other words, any residually finite group of finite upper rank, which is not soluble-by-finite, has the $R_\infty$ property). This reduction is the first step in the proof of the second main theorem of the paper: suppose, $G$ is a residually finite group of finite Prüfer rank and $φ$ is its automorphism with $R(φ)<\infty$; then $R(φ)$ is equal to the number of equivalence…
We prove a version of the Tits alternative for groups acting on complete, finite rank median spaces. This shows that group actions on finite rank median spaces are much more restricted than actions on general median spaces. Along the way, we extend to median spaces the Caprace-Sageev machinery and part of Hagen's theory of unidirectional boundary sets.