2000 character limit reached
Concise presentations of direct products
Published 16 Oct 2017 in math.GR | (1710.05904v1)
Abstract: Direct powers of perfect groups admit more concise presentations than one might naively suppose. If $H_1G=H_2G=0$, then $Gn$ has a presentation with $O(\log n)$ generators and $O(\log n)3$ relators. If, in addition, there is an element $g\in G$ that has infinite order in every non-trivial quotient of $G$, then $Gn$ has a presentation with $d(G) +1$ generators and $O(\log n)$ relators. The bounds that we obtain on the deficiency of $Gn$ are not monotone in $n$; this points to potential counterexamples for the Relation Gap Problem.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.