Related papers: Near Ascending HNN-Extensions and a Combination Re…
A hierarchy of a group is a rooted tree of groups obtained by iteratively passing to vertex groups of graphs of groups decompositions. We define a (relative) slender JSJ hierarchy for (almost) finitely presented groups and show that it is…
Taking residual finiteness as a starting point, we consider three related finiteness properties: weak subsemigroup separability, strong subsemigroup separability and complete separability. We investigate whether each of these properties is…
We introduce the notion of finite stature of a family $\{H_i\}$ of subgroups of a group $G$. We investigate the separability of subgroups of a group $G$ that splits as a graph of hyperbolic special groups with quasiconvex edge groups. We…
Let G be a reductive linear algebraic group over an algebraically closed field of characteristic p > 0. A subgroup of G is said to be separable in G if its global and infinitesimal centralizers have the same dimension. We study the…
Broadly speaking, a finiteness property of groups is any generalisation of the property of having finite order. A large part of infinite group theory is concerned with finiteness properties and the relationships between them. Profinite…
We show that a free action $G \curvearrowright X$ is almost finite if its restriction to some infinite normal subgroup of $G$ is almost finite. Consider the class of groups which contains all infinite groups of locally subexponential growth…
The solubility graph $\Gamma_S(G)$ associated with a finite group $G$ is a simple graph whose vertices are the elements of $G$, and there is an edge between two distinct vertices if and only if they generate a soluble subgroup. In this…
We show that an infinite group $G$ definable in a $1$-h-minimal field admits a strictly $K$-differentiable structure with respect to which $G$ is a (weak) Lie group, and show that definable local subgroups sharing the same Lie algebra have…
Autostackability for finitely presented groups is a topological property of the Cayley graph combined with formal language theoretic restrictions, that implies solvability of the word problem. The class of autostackable groups is known to…
We state conditions for which a definable local homomorphism between two locally definable groups $\mathcal{G}$, $\mathcal{G^{\prime}}$ can be uniquely extended when $\mathcal{G}$ is simply connected (Theorem 2.1). As an application of this…
We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…
The nilpotent graph of a group $G$ is the simple and undirected graph whose vertices are the elements of $G$ and two distinct vertices are adjacent if they generate a nilpotent subgroup of $G$. Here we discuss some topological properties of…
T.C. Burness and S.D. Scott \cite{3} classified finite groups $G$ such that the number of prime order subgroups of $G$ is greater than $|G|/2-1$. In this note, we study finite groups $G$ whose subgroup graph contains a vertex of degree…
Let $G$ be a finite insoluble group with soluble radical $ R(G)$. The solubility graph $\Gamma_{\rm S}(G)$ of $G$ is a simple graph whose vertices are the elements of $G\setminus R(G) $ and two distinct vertices $x$ and $y$ are adjacent if…
In various occasions the conjugacy problem in finitely generated amalgamated products and HNN extensions can be decided efficiently for elements which cannot be conjugated into the base groups. This observation asks for a bound on how many…
How different is the universal cover of a given finite 2-complex from a 3-manifold (from the proper homotopy viewpoint)? Regarding this question, we recall that a finitely presented group $G$ is said to be properly 3-realizable if there…
A fundamental notion in group theory, which originates in an article of Ulam and von Neumann from $1947$ is uniform simplicity. A group $G$ is said to be $n$-uniformly simple for $n \in \mathbf{N}$ if for every $f,g\in G\setminus \{id\}$,…
We show that any pseudofinite group with NIP theory and with a finite upper bound on the length of chains of centralisers is soluble-by-finite. In particular, any NIP rosy pseudofinite group is soluble-by-finite. This generalises, and…
We introduce and study asymptotically rigid mapping class groups of certain infinite graphs. We determine their finiteness properties and show that these depend on the number of ends of the underlying graph. In a special case where the…
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…