Excluding four exceptional cases, we determine the asphericity of the relative presentation for m ⩾ 2. If H = ⟨g, h⟩ ⩽ G, then the exceptional cases occur when H is isomorphic to C5 or C6.

This note completes the proof of the structure theorem for pp-matroid groups which was stated in our earlier paper J. Krempa and A. Stocka [‘On sets of pp-generators of finite groups’, Bull. Aust. Math. Soc.91 (2015), 241–249].

We explore transversals of finite index subgroups of finitely generated groups. We show that when $H$ is a subgroup of a rank-$n$ group $G$ and $H$ has index at least $n$ in $G$, we can construct a left transversal for $H$ which contains a generating set of size $n$ for $G$; this construction is algorithmic when $G$ is finitely presented. We also show that, in the case where $G$ has rank $n\leq 3$, there is a simultaneous left–right transversal for $H$ which contains a generating set of size $n$ for $G$. We finish by showing that if $H$ is a subgroup of a rank-$n$ group $G$ with index less than $3\cdot 2^{n-1}$, and $H$ contains no primitive elements of $G$, then $H$ is normal in $G$ and $G/H\cong C_{2}^{n}$.

The classes of finite groups with minimal sets of generators of fixed cardinalities, named ${\mathcal{B}}$-groups, and groups with the basis property, in which every subgroup is a ${\mathcal{B}}$-group, contain only $p$-groups and some $\{p,q\}$-groups. Moreover, abelian ${\mathcal{B}}$-groups are exactly $p$-groups. If only generators of prime power orders are considered, then an analogue of property ${\mathcal{B}}$ is denoted by ${\mathcal{B}}_{pp}$ and an analogue of the basis property is called the pp-basis property. These classes are larger and contain all nilpotent groups and some cyclic $q$-extensions of $p$-groups. In this paper we characterise all finite groups with the pp-basis property as products of $p$-groups and precisely described $\{p,q\}$-groups.

We describe various classes of infinitely presented groups that are condensation points in the space of marked groups. A well-known class of such groups consists of finitely generated groups admitting an infinite minimal presentation. We introduce here a larger class of condensation groups, called infinitely independently presentable groups, and establish criteria which allow one to infer that a group is infinitely independently presentable. In addition, we construct examples of finitely generated groups with no minimal presentation, among them infinitely presented groups with Cantor–Bendixson rank 1, and we prove that every infinitely presented metabelian group is a condensation group.

An interesting result of Ivanov implies that a non-aspherical relative presentation that defines a torsion-free group would provide a potential counterexample to the Kaplansky zero-divisor conjecture. In this point of view, we prove the asphericity of the length-6 relative presentation $\langle H,x: xh_1xh_2xh_3xh_4xh_5xh_6\rangle$, provided that each coefficient is torsion free.

We pose some graph theoretic conjectures about duality and the diameter of maximal trees in planar graphs, and we give innovations in the following two topics in geometric group theory, where the conjectures have applications.

Central extensions. We describe an electrostatic model concerning how van Kampen diagrams change when one takes a central extension of a group. Modulo the conjectures, this leads to a new proof that finitely generated class $c$ nilpotent groups admit degree $c+1$ polynomial isoperimetric functions.

Filling functions. We collate and extend results about interrelationships between filling functions for finite presentations of groups. We use the electrostatic model in proving that the gallery length filling function, which measures the diameter of the duals of diagrams, is qualitatively the same as a filling function DlogA, concerning the sum of the diameter with the logarithm of the area of a diagram. We show that the conjectures imply that the space-complexity filling function filling length essentially equates to gallery length. We give linear upper bounds on these functions for a number of classes of groups including fundamental groups of compact geometrizable 3-manifolds, certain graphs of groups, and almost convex groups. Also we define restricted filling functions which concern diagrams with uniformly bounded vertex valence, and we show that, assuming the conjectures, they reduce to just two filling functions—the analogues of non-deterministic space and time.

Bounds are obtained for the minimum number of generators for the fundamental groups of a family of closed 3-dimensional manifolds. A significant role has been played by the use of computers.

Let R be a ring with 1 and En (R) be the subgroup of GLn(R) generated by the matrices I + reij, r ∈ R, i ≠ j. We prove that the subgroup of consisting of the matrices of shape , where and , is (2, 3, 7)-generated whenever R is finitely generated and n, are large enough.

This paper reports on a facility of the ANU NQ program for computation of nilpotent groups that satisfy an Engel-n identity. The relevant details of the algorithm are presented together with results on Engel-n groups for moderate values of n.

We study some challenging presentations which arise as groups of deficiency zero. In four cases we settle finiteness: we show that two presentations are for finite groups while two are for infinite groups. Thus we answer three explicit questions in the literature and we provide the first published deficiency zero presentation for a group with derived length seven. The tools we use are coset enumeration and Knuth-Bebdix rewriting, which are well-established as methods for proving finiteness or otherwise of a finitely presented group. We briefly comment on their capabilities and compare their performance.

We survey the current state of knowledge of bounds in the restricted Burnside problem. We make two conjectures which are related to the theory of PI-algebras.