Loading...
research article
Homogeneous number of free generators
Aka, Menny
•
Gelander, Tsachik
•
Soifer, Gregory A.
We address two questions of Simon Thomas. First, we show that for any n >= 3 one can find a four-generated free subgroup of SLn (Z) which is profinitely dense. More generally, we show that an arithmetic group Gamma that admits the congruence subgroup property has a profinitely-dense free subgroup with an explicit bound on its rank. Next, we show that the set of profinitely-dense, locally-free subgroups of such an arithmetic group Gamma is uncountable.
Type
research article
Web of Science ID
WOS:000338850000001
Authors
Aka, Menny
•
Gelander, Tsachik
•
Soifer, Gregory A.
Publication date
2014
Publisher
Published in
Volume
17
Issue
4
Start page
525
End page
539
Peer reviewed
REVIEWED
EPFL units
Available on Infoscience
August 29, 2014
Use this identifier to reference this record