SearcharxivSearch

arXiv subjects

Martin R. Bridson

Publications and source records attributed to Martin R. Bridson.

At least 19 recordsLinked to original sources

Groups with fast-growing conjugator length functions

We construct the first examples of finitely presented groups whose conjugator length function is exponential; these are central extensions of groups of the form $F_m\rtimes F_2$. Further, we use a fibre product construction to exhibit a family of finitely presented groups $Γ_k$ where, for each $k$, the conjugator length function of $Γ_k$ grows like functions lying in the $k$-th level of the Grzegorczyk hierarchy of primitive recursive functions.

math.GR

Conjugator length in finitely presented groups

The conjugator length function of a finitely generated group $G$ gives the minimal upper bound on the length of a conjugator for a pair of words that represent conjugate elements in $G$, as a function of the sum of the lengths of the words. Here, we seek to promote the systematic study of conjugator length functions by explaining their significance, by surveying what is known about them and by explaining fundamental techniques and examples.

math.GR

On the conjugacy problem for subdirect products of hyperbolic groups

If $G_1$ and $G_2$ are torsion-free hyperbolic groups and $P<G_1\times G_2$ is a finitely generated subdirect product, then the conjugacy problem in $P$ is solvable if and only if there is a uniform algorithm to decide membership of the cyclic subgroups in the finitely presented group $G_1/(P\cap G_1)$. The proof of this result relies on a new technique for perturbing elements in a hyperbolic group to ensure that they are not proper powers.

math.GR

The lengths of conjugators in the model filiform groups

The conjugator length function of a finitely generated group $Γ$ gives the optimal upper bound on the length of a shortest conjugator for any pair of conjugate elements in the ball of radius $n$ in the Cayley graph of $Γ$. We prove that polynomials of arbitrary degree arise as conjugator length functions of finitely presented groups. To establish this, we analyse the geometry of conjugation in the discrete model filiform groups $Γ_d = \mathbb{Z}^d\rtimes_ϕ\mathbb{Z}$ where is $ϕ$ is the automorphism of $\mathbb{Z}^d$ that fixes the last element of a basis $a_1,\dots,a_d$ and sends $a_i$ to $a_ia_{i+1}$ for $i<d$. The conjugator length function of $Γ_d$ is polynomial of degree $d$.

math.GR

Linear Diophantine equations and conjugator length in 2-step nilpotent groups

We establish upper bounds on the lengths of minimal conjugators in 2-step nilpotent groups. These bounds exploit the existence of small integral solutions to systems of linear Diophantine equations. We prove that in some cases these bounds are sharp. This enables us to construct a family of finitely generated 2-step nilpotent groups $(G_m)_{m\in\mathbb{N}}$ such that the conjugator length function of $G_m$ grows like a polynomial of degree $m+1$.

math.GR

Snowflake groups and conjugator length functions with non-integer exponents

We exhibit novel geometric phenomena in the study of conjugacy problems for discrete groups. We prove that the snowflake groups $B_{pq}$, indexed by pairs of positive integers $p>q$, have conjugator length functions $\text{CL}(n)\simeq n$ and annular Dehn functions $\text{Ann}(n) \simeq n^{2α}$, where $α= \log_2(2p/q)$. Then, building on $B_{pq}$, we construct groups $\tilde{B}_{pq}^+$, for which $\text{CL}(n)\simeq n^{α+1}$. Thus the conjugator length spectrum and the spectrum of exponents of annular Dehn functions are both dense in the range $[2,\infty)$.

math.GR

HNN extensions and embedding theorems for groups

The Higman-Neumann-Neumann (HNN) paper of 1949 is a landmark of group theory in the twentieth century. The proof of its main theorem covers less than a page and uses only pre-existing technology, but the construction that it introduced -- the HNN extension -- quickly became one of the principal tools of combinatorial group theory, widely used to build new groups and to describe enlightening decompositions of existing groups. In this article, we shall describe the contents of the HNN paper, and then discuss some of the important developments that followed in its wake, leading up to the central role that HNN extensions play in the Bass--Serre theory of groups acting on trees.

math.GR

Relatively hyperbolic groups, Grothendieck pairs, and uncountable profinite ambiguity among fibre products

These notes expand upon our lectures on {\em profinite rigidity} at the international colloquium on randomness, geometry and dynamics, organised by TIFR Mumbai at IISER Pune in January 2024. We are interested in the extent to which groups that arise in hyperbolic geometry and 3-manifold topology are determined by their finite quotients. The main theme of these notes is the radical extent to which rigidity is lost when one passes from consideration of groups with hyperbolic features to consideration of their direct products. We describe a general method for producing infinite sequences of {\em{Grothendieck pairs,}} i.e.~embeddings $P_i\hookrightarrow G\times G$ inducing isomorphisms of profinite completions, with $G$ fixed and $P_i$ finitely generated. In order to apply this method, one needs $G$ to map onto a subgroup of finite index in the commutator subgroup of a group $Γ$ with $H_2(Γ,\mathbb{Z})=0$, and $Γ$ should be relatively hyperbolic. By exploiting the flexibility of the construction, we explain how, under the same hypotheses on $G$, one can construct {\em uncountable families} of pairwise non-isomorphic subgroups $P_λ$ such that $P_λ\hookrightarrow G\times G$ induces an isomorphism of profinite completions. Examples of groups $G$ satisfying these conditions include the fundamental group of the Weeks manifold and the fundamental group of the 4-fold branch cover of the figure-8 knot complement. Both of these examples are profinitely rigid in the absolute sense and in each case Grothendieck pairs account entirely for the loss of profinite rigidity for $G\times G$: if $H$ is a finitely generated group whose profinite completion is isomorphic to that of $G\times G$, then there is an embedding $H\hookrightarrow G\times G$ that is a Grothendieck pair.

math.GR

Conjugacy in a family of free-by-cyclic groups

We analyse the geometry and complexity of the conjugacy problem in a family of free-by-cyclic groups $H_m=F_m\rtimes\mathbb{Z}$ where the defining free-group automorphism is positive and polynomially growing. We prove that the conjugator length function of $H_m$ is linear, and describe polynomial-time solutions to the conjugacy problem and conjugacy search problem in $H_m$.

math.GR

Ordinals arising as residual finiteness depths

For every natural number $n$, there exist finitely presented groups with residual finiteness depths $ω\cdot n$ and $ω\cdot n + 1$. The ordinals that arise as the residual finiteness depth of a finitely generated group (equivalently, a countable group) are $0,\, 1$, the countable limit ordinals, and the successors of these limit ordinals.

math.GR

Helly-type theorems, CAT$(0)$ spaces, and actions of automorphism groups of free groups

We prove a variety of fixed-point theorems for groups acting on CAT$(0)$ spaces. Fixed points are obtained by a bootstrapping technique, whereby increasingly large subgroups are proved to have fixed points: specific configurations in the subgroup lattice of $Γ$ are exhibited and Helly-type theorems are developed to prove that the fixed-point sets of the subgroups in the configuration intersect. In this way, we obtain lower bounds on the smallest dimension ${\rm{FixDim}}(Γ)+1$ in which various groups of geometric interest can act on a complete CAT$(0)$ space without a global fixed point. For automorphism groups of free groups, we prove ${\rm{FixDim}}({\rm{Aut}}(F_n)) \ge \lfloor 2n/3\rfloor$.

math.GR

Chasing finite shadows of infinite groups through geometry

There are many situations in geometry and group theory where it is natural, convenient or necessary to explore infinite groups via their actions on finite objects, i.e. via the finite quotients of the group. But how much understanding can one really gain about an infinite group by examining its finite images? Which properties of the group can one recognise, and when does the set of finite images determine the group completely? How hard is it to decide what the finite images of a given infinite group are? These notes follow my plenary lecture at the ECM in Sevilla, July 2024. The goal of the lecture was to sketch some of the rich history of the preceding problems and to present results that illustrate how the field surrounding these questions has been transformed in recent years by input from low-dimensional topology and the study of non-positively curved spaces.

math.GR

Stallings's Fibring Theorem and $\mathrm{PD}^3$-pairs

We give a relatively self-contained proof that if a group $G$ fibres algebraically and is part of a $\mathrm{PD}^3$-pair, then $G$ is the fundamental group of a fibred compact aspherical 3-manifold. This yields a homological proof of a classical theorem of Stallings: if $G = π_1(M^3)$ is the fundamental group of a compact irreducible 3-manifold $M^3$ and $ϕ\colon G \to \mathbb{Z}$ is a surjective homomorphism with finitely generated kernel, then $ϕ$ is induced by a topological fibration of $M^3$ over the circle.

math.GT

Profinite rigidity for free-by-cyclic groups with centre

A free-by-cyclic group $F_N\rtimes_ϕ\mathbb{Z}$ has non-trivial centre if and only if $[ϕ]$ has finite order in ${\rm{Out}}(F_N)$. We establish a profinite ridigity result for such groups: if $Γ_1$ is a free-by-cyclic group with non-trivial centre and $Γ_2$ is a finitely generated free-by-cyclic group with the same finite quotients as $Γ_1$, then $Γ_2$ is isomorphic to $Γ_1$. One-relator groups with centre are similarly rigid. We prove that finitely generated free-by-(finite cyclic) groups are profinitely rigid in the same sense; the proof revolves around a finite poset $\mathbf{fsc}(G)$ that carries information about the centralisers of finite subgroups of $G$ -- it is a complete invariant for these groups. These results provide contrasts with the lack of profinite rigidity among surface-by-cyclic groups and (free abelian)-by-cyclic groups, as well as general virtually-free groups.

math.GR

On the geometry of the free factor graph for ${\rm{Aut}}(F_N)$

Let $Φ$ be a pseudo-Anosov diffeomorphism of a compact (possibly non-orientable) surface $Σ$ with one boundary component. We show that if $b \in π_1(Σ)$ is the boundary word, $ϕ\in {\rm{Aut}}(π_1(Σ))$ is a representative of $Φ$ fixing $b$, and ${\rm{ad}}_b$ denotes conjugation by $b$, then the orbits of $\langle ϕ, {\rm{ad}}_b \rangle\cong\mathbb{Z}^2$ in the graph of free factors of $π_1(Σ)$ are quasi-isometrically embedded. It follows that for $N \geq 2$ the free factor graph for ${\rm{Aut}}(F_N)$ is not hyperbolic, in contrast to the ${\rm{Out}}(F_N)$ case.

math.GT

Complete Embeddings of Groups

Every countable group $G$ can be embedded in a finitely generated group $G^*$ that is hopfian and complete, i.e. $G^*$ has trivial centre and every epimorphism $G^*\to G^*$ is an inner automorphism. Every finite subgroup of $G^*$ is conjugate to a finite subgroup of $G$. If $G$ has a finite presentation (respectively, a finite classifying space), then so does $G^*$. Our construction of $G^*$ relies on the existence of closed hyperbolic 3-manifolds that are asymmetric and non-Haken.

math.GR

Profinite completions of free-by-free groups contain everything

Given an arbitrary, finitely presented, residually finite group $Γ$, one can construct a finitely generated, residually finite, free-by-free group $M_Γ= F_\infty\rtimes F_4$ and an embedding $M_Γ\hookrightarrow (F_4\ast Γ)\times F_4$ that induces an isomorphism of profinite completions. In particular, there is a free-by-free group whose profinite completion contains $\widehatΓ$ as a retract.

math.GR