Binary Subgroups of Direct Products
Abstract
We explore an elementary construction that produces finitely presented groups with diverse homological finiteness properties -- the binary subgroups, B(,μ)<G1×…× Gm. These full subdirect products require strikingly few generators. If each Gi is finitely presented, B(,μ) is finitely presented. When the Gi are non-abelian limit groups (e.g. free or surface groups), the B(,μ) 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 G1,…,Gm are perfect groups, each requiring at most r generators, then G1×…× Gm requires at most r 2 m+1 generators.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.