SearcharxivSearch

arXiv · 2202.02123

Binary Subgroups of Direct Products

Abstract

We explore an elementary construction that produces finitely presented groups with diverse homological finiteness properties -- the {\em binary subgroups}, $B(\Sigma,\mu)<G_1\times\dots\times G_m$. These full subdirect products require strikingly few generators. If each $G_i$ is finitely presented, $B(\Sigma,\mu)$ is finitely presented. When the $G_i$ are non-abelian limit groups (e.g. free or surface groups), the $B(\Sigma,\mu)$ provide new examples of finitely presented, residually-free groups that do not have finite classifying spaces and are not of Stallings-Bieri type. These examples settle a question of Minasyan relating different notions of rank for residually-free groups. Using binary subgroups, we prove that if $G_1,\dots,G_m$ are perfect groups, each requiring at most $r$ generators, then $G_1\times\dots\times G_m$ requires at most $r \lfloor \log_2 m+1 \rfloor$ generators.

Explore related subjects

Keep this discovery

BibTeXRIS

Martin R. Bridson. 2022-02-04. Binary Subgroups of Direct Products. https://arxiv.org/abs/2202.02123

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR