We extend work of Berdinsky and Khoussainov [‘Cayley automatic representations of wreath products’, International Journal of Foundations of Computer Science27(2) (2016), 147–159] to show that being Cayley automatic is closed under taking the restricted wreath product with a virtually infinite cyclic group. This adds to the list of known examples of Cayley automatic groups.

Generalising previous results on classical braid groups by Artin and Lin, we determine the values of m, n ∈ $\mathbb N$ for which there exists a surjection between the n- and m-string braid groups of an orientable surface without boundary. This result is essentially based on specific properties of their lower central series, and the proof is completely combinatorial. We provide similar but partial results in the case of orientable surfaces with boundary components and of non-orientable surfaces without boundary. We give also several results about the classification of different representations of surface braid groups in symmetric groups.

We consider the Birman–Hilden inclusion $\phi\colon\Br_{2g+1}\to\Gamma_{g,1}$ of the braid group into the mapping class group of an orientable surface with boundary, and prove that $\phi$ is stably trivial in homology with twisted coefficients in the symplectic representation $H_1(\Sigma_{g,1})$ of the mapping class group; this generalises a result of Song and Tillmann regarding homology with constant coefficients. Furthermore we show that the stable homology of the braid group with coefficients in $\phi^*(H_1(\Sigma_{g,1}))$ has only 4-torsion.

Let W be a 2-dimensional Coxeter group, that is, one with 1/mst + 1/msr + 1/mtr ≤ 1 for all triples of distinct s, t, r ∈ S. We prove that W is biautomatic. We do it by showing that a natural geodesic language is regular (for arbitrary W), and satisfies the fellow traveller property. As a consequence, by the work of Jacek Świątkowski, groups acting properly and cocompactly on buildings of type W are also biautomatic. We also show that the fellow traveller property for the natural language fails for $W=\widetilde {A}_3$.

This is the first of a series of two papers dealing with local limit theorems in relatively hyperbolic groups. In this first paper, we prove rough estimates for the Green function. Along the way, we introduce the notion of relative automaticity which will be useful in both papers and we show that relatively hyperbolic groups are relatively automatic. We also define the notion of spectral positive recurrence for random walks on relatively hyperbolic groups. We then use our estimates for the Green function to prove that $p_n\asymp R^{-n}n^{-3/2}$ for spectrally positive-recurrent random walks, where $p_n$ is the probability of going back to the origin at time n and where R is the inverse of the spectral radius of the random walk.

The Σ-invariants of Bieri–Neumann–Strebel and Bieri–Renz involve an action of a discrete group G on a geometrically suitable space M. In the early versions, M was always a finite-dimensional Euclidean space on which G acted by translations. A substantial literature exists on this, connecting the invariants to group theory and to tropical geometry (which, actually, Σ-theory anticipated). More recently, we have generalized these invariants to the case where M is a proper CAT(0) space on which G acts by isometries. The “zeroth stage” of this was developed in our paper [BG16]. The present paper provides a higher-dimensional extension of the theory to the “nth stage” for any n.

We present a metric condition $\TTMetric$ which describes the geometry of classical small cancellation groups and applies also to other known classes of groups such as two-dimensional Artin groups. We prove that presentations satisfying condition $\TTMetric$ are diagrammatically reducible in the sense of Sieradski and Gersten. In particular, we deduce that the standard presentation of an Artin group is aspherical if and only if it is diagrammatically reducible. We show that, under some extra hypotheses, $\TTMetric$-groups have quadratic Dehn functions and solvable conjugacy problem. In the spirit of Greendlinger's lemma, we prove that if a presentation P = 〈X| R〉 of group G satisfies conditions $\TTMetric -C'(\frac {1}{2})$, the length of any nontrivial word in the free group generated by X representing the trivial element in G is at least that of the shortest relator. We also introduce a strict metric condition $\TTMetricStrict$, which implies hyperbolicity.

We show that Gromov’s monsters arising from i.i.d. random labellings of expanders (that we call random Gromov’s monsters) have linear divergence along a subsequence, so that in particular they do not contain Morse quasigeodesics, and they are not quasi-isometric to Gromov’s monsters arising from graphical small cancellation labellings of expanders.

Moreover, by further studying the divergence function, we show that there are uncountably many quasi-isometry classes of random Gromov’s monsters.

Let G be a finite group and $\psi (G) = \sum _{g \in G} o(g)$ , where $o(g)$ denotes the order of $g \in G$ . There are many results on the influence of this function on the structure of a finite group G.

In this paper, as the main result, we answer a conjecture of Tărnăuceanu. In fact, we prove that if G is a group of order n and $\psi (G)>31\psi (C_n)/77$ , where $C_n$ is the cyclic group of order n, then G is supersolvable. Also, we prove that if G is not a supersolvable group of order n and $\psi (G) = 31\psi (C_n)/77$ , then $G\cong A_4 \times C_m$ , where $(m, 6)=1$ .

Finally, Herzog et al. in (2018, J. Algebra, 511, 215–226) posed the following conjecture: If $H\leq G$ , then $\psi (G) \unicode[stix]{x02A7D} \psi (H) |G:H|^2$ . By an example, we show that this conjecture is not satisfied in general.

We say that a group G of local (maybe formal) biholomorphisms satisfies the uniform intersection property if the intersection multiplicity $(\phi (V), W)$ takes only finitely many values as a function of G for any choice of analytic sets V and W of complementary dimension. In dimension $2$ we show that G satisfies the uniform intersection property if and only if it is finitely determined – that is, if there exists a natural number k such that different elements of G have different Taylor expansions of degree k at the origin. We also prove that G is finitely determined if and only if the action of G on the space of germs of analytic curves has discrete orbits.

The pronorm of a group G is the set $P(G)$ of all elements $g\in G$ such that X and $X^g$ are conjugate in ${\langle {X,X^g}\rangle }$ for every subgroup X of G. In general the pronorm is not a subgroup, but we give evidence of some classes of groups in which this property holds. We also investigate the structure of a generalised soluble group G whose pronorm contains a subgroup of finite index.

In this note we show that every element of a simple Suzuki group $^2B_2(q)$ is a commutator of elements of coprime orders.

We link distinct concepts of geometric group theory and homotopy theory through underlying combinatorics. For a flag simplicial complex $K$, we specify a necessary and sufficient combinatorial condition for the commutator subgroup $RC_K'$ of a right-angled Coxeter group, viewed as the fundamental group of the real moment-angle complex $\mathcal {R}_K$, to be a one-relator group; and for the Pontryagin algebra $H_{*}(\Omega \mathcal {Z}_K)$ of the moment-angle complex to be a one-relator algebra. We also give a homological characterization of these properties. For $RC_K'$, it is given by a condition on the homology group $H_2(\mathcal {R}_K)$, whereas for $H_{*}(\Omega \mathcal {Z}_K)$ it is stated in terms of the bigrading of the homology groups of $\mathcal {Z}_K$.

For a group G, we define a graph $\Delta (G)$ by letting $G^{\scriptsize\#}=G\setminus {\{\,1\,\}} $ be the set of vertices and by drawing an edge between distinct elements $x,y\in G^{\scriptsize\#}$ if and only if the subgroup $\langle x,y\rangle $ is cyclic. Recall that a Z-group is a group where every Sylow subgroup is cyclic. In this short note, we investigate $\Delta (G)$ for a Z-group G.

It is conjectured that the central quotient of any irreducible Artin–Tits group is either virtually cyclic or acylindrically hyperbolic. We prove this conjecture for Artin–Tits groups that are known to be CAT(0) groups by a result of Brady and McCammond, that is, Artin–Tits groups associated with graphs having no 3-cycles and Artin–Tits groups of almost large type associated with graphs admitting appropriate directions. In particular, the latter family contains Artin–Tits groups of large type associated with cones over square-free bipartite graphs.

We consider the Newton stratification on Iwahori-double cosets in the loop group of a reductive group. We describe a group-theoretic condition on the generic Newton point, called cordiality, under which the Newton poset (that is, the index set for non-empty Newton strata) is saturated and Grothendieck’s conjecture on closures of the Newton strata holds. Finally, we give several large classes of Iwahori-double cosets for which this condition is satisfied by studying certain paths in the associated quantum Bruhat graph.

A right Engel sink of an element g of a group G is a set ${\mathscr R}(g)$ such that for every x ∈ G all sufficiently long commutators $[...[[g,x],x],\dots ,x]$ belong to ${\mathscr R}(g)$. (Thus, g is a right Engel element precisely when we can choose ${\mathscr R}(g)=\{ 1\}$.) It is proved that if every element of a compact (Hausdorff) group G has a countable right Engel sink, then G has a finite normal subgroup N such that G/N is locally nilpotent.

We show that for every non-elementary hyperbolic group the Bowen–Margulis current associated with a strongly hyperbolic metric forms a unique group-invariant Radon measure class of maximal Hausdorff dimension on the boundary square. Applications include a characterization of roughly similar hyperbolic metrics via mean distortion.

The main objective of this paper is the following two results. (1) There exists a computable bi-orderable group that does not have a computable bi-ordering; (2) there exists a bi-orderable, two-generated computably presented solvable group with undecidable word problem. Both of the groups can be found among two-generated solvable groups of derived length $3$.

(1) [a]nswers a question posed by Downey and Kurtz; (2) answers a question posed by Bludov and Glass in Kourovka Notebook.

One of the technical tools used to obtain the main results is a computational extension of an embedding theorem of B. Neumann that was studied by the author earlier. In this paper we also compliment that result and derive new corollaries that might be of independent interest.

We consider the graph $\Gamma _{\text {virt}}(G)$ whose vertices are the elements of a finitely generated profinite group G and where two vertices x and y are adjacent if and only if they topologically generate an open subgroup of G. We investigate the connectivity of the graph $\Delta _{\text {virt}}(G)$ obtained from $\Gamma _{\text {virt}}(G)$ by removing its isolated vertices. In particular, we prove that for every positive integer t, there exists a finitely generated prosoluble group G with the property that $\Delta _{\operatorname {\mathrm {virt}}}(G)$ has precisely t connected components. Moreover, we study the graph $\widetilde \Gamma _{\operatorname {\mathrm {virt}}}(G)$ , whose vertices are again the elements of G and where two vertices are adjacent if and only if there exists a minimal generating set of G containing them. In this case, we prove that the subgraph $\widetilde \Delta _{\operatorname {\mathrm {virt}}}(G)$ obtained removing the isolated vertices is connected and has diameter at most 3.