2000 character limit reached
The Congruence Subgroup Problem for the Free Metabelian Group on two generators
Published 12 Dec 2013 in math.GR | (1312.3480v2)
Abstract: In this paper we describe the profinite completion of the free solvable group on m generators of solvability length r>1. Then, we show that for m=r=2, the free metabelian group on two generators does not have the Congruence Subgroup Property.
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.