Abstract
Let G be a finite group, ZG the integral group ring of G and U(ZG) the group of units of ZG. The Congruence Subgroup Problem for U(ZG) is the problem of deciding if every subgroup of finite index of U(ZG) contains a congruence subgroup, i.e. the kernel of the natural homomorphism U(ZG)→U(ZG/mZG) for some positive integer m. The congruence kernel of U(ZG) is the kernel of the natural map from the completion of U(ZG) with respect to the profinite topology to the completion with respect to the topology defined by the congruence subgroups. The Congruence Subgroup Problem has a positive solution if and only if the congruence kernel is trivial. We obtain an approximation to the problem of classifying the finite groups for which the congruence kernel of U(ZG) is finite. More precisely, we obtain a list L formed by three families of finite groups and 19 additional groups such that if the congruence kernel of U(ZG) is infinite then G has an epimorphic image isomorphic to one of the groups of L. Regarding the converse of this statement we at least know that if one of the 19 additional groups in L is isomorphic to an epimorphic image of G then the congruence kernel of U(ZG) is infinite. However, to decide for the finiteness of the congruence kernel in case G has an epimorphic image isomorphic to one of the groups in the three families of L one needs to know if the congruence kernel of the group of units of an order in some specific division algebras is finite and this seems a difficult problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.