Baumslag–Gersten group

The Baumslag–Gersten group G was originally introduced in a 1969 paper of Gilbert Baumslag,[1] as an example of a non-residually finite one-relator group with an additional remarkable property that all finite quotient groups of this group are cyclic. Later, in 1992, Stephen Gersten[2] showed that G, despite being a one-relator group given by a rather simple presentation, has the Dehn function growing very quickly, namely faster than any fixed iterate of the exponential function. This example remains the fastest known growth of the Dehn function among one-relator groups. In 2011 Alexei Myasnikov, Alexander Ushakov, and Dong Wook Won[3] proved that G has the word problem solvable in polynomial time.

The Baumslag–Gersten group G can also be realized as an HNN extension of the Baumslag–Solitar group ${\displaystyle BS(1,2)=\langle a,b\mid a^{b}=a^{2}\rangle }$ with stable letter t and two cyclic associated subgroups${\displaystyle \langle a\rangle ,\langle b\rangle }$:

${\displaystyle G=\langle a,t\mid a^{a^{t}}=a^{2}\rangle =\langle a,b,t\mid a^{b}=a^{2},a^{t}=b\rangle .}$

• Every finite quotient group of G is cyclic. In particular, the group G is not residually finite.[1]
• An endomorphism of G is either an automorphism or its image is a cyclic subgroup of G. In particular the group G is Hopfian and co-Hopfian.[4]
• The outer automorphism group Out(G) of G is isomorphic to the additive group of dyadic rationals ${\displaystyle \mathbb {Z} \left[{\frac {1}{2}}\right]}$ and in particular is not finitely generated.[4]
• Gersten proved[2] that the Dehn function f(n) of G grows faster than any fixed iterate of the exponential. Subsequently A. N. Platonov[5] proved that f(n) is equivalent to

${\displaystyle \exp ^{\circ \log n}(1)=(\exp \underbrace {\circ \cdots \circ } _{\log n{\text{ times }}}\exp )(1)}$

• Myasnikov, Ushakov, and Won,[3] using compression methods of ``power circuits" arithmetics, proved that the word problem in G is solvable in polynomial time. Thus the group G exhibits a large gap between the growth of its Dehn function and the complexity of its word problem.
• The conjugacy problem in G is known to be decidable, but the only known worst-case upper bound estimate for the complexity of the conjugacy problem, due to Janis Beese, is elementary recursive.[6] It is conjectured that this estimate is sharp, based on some reductions to power circuit division problems.[7] There is a strongly generically polynomial time solution of the conjugacy problem for G.[7]

• Andrew Brunner[4] considered one-relator groups of the form

${\displaystyle \langle a,t\mid (a^{p})^{(t^{-1}a^{k}t)}=a^{m}\rangle ,}$ where ${\displaystyle p,k,m\neq 0}$

and generalized many of Baumslag's original results in that context.

• Mahan Mitra[8] considered a word-hyperbolic analog G of the Baumslag–Gersten group, where Mitra's group possesses a rank three free subgroup that is highly distorted in G, namely where the subgroup distortion is higher than any fixed iterated power of the exponential.

• Subgroup distortion

• Distortion of finitely presented subgroups of non-positively curved groups, the blog of the Spring 2011 Berstein Seminar at Cornell, including van Kampen diagrams demonstrating subgroup distortion in the Baumslag–Gersten group and the discussion of Mitra-like examples