Mathematics > Group Theory
[Submitted on 4 Feb 2022 (v1), last revised 31 Aug 2022 (this version, v2)]
Title:Binary Subgroups of Direct Products
View PDFAbstract: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.
Submission history
From: Martin R. Bridson [view email][v1] Fri, 4 Feb 2022 13:27:46 UTC (17 KB)
[v2] Wed, 31 Aug 2022 14:38:44 UTC (17 KB)
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.