Papers
Topics
Authors
Recent
Search
2000 character limit reached

On profinite groups with commutators covered by countably many cosets

Published 13 Nov 2017 in math.GR | (1711.04859v1)

Abstract: Let w be a group-word. Suppose that the set of all w-values in a profinite group G is contained in a union of countably many cosets of subgroups. We are concerned with the question to what extent the structure of the verbal subgroup w(G) depends on the properties of the subgroups. We prove the following theorem. Let C be a class of groups closed under taking subgroups, quotients, and such that in any group the product of finitely many normal C-subgroups is again a C-subgroup. If w is a multilinear commutator and G is a profinite group such that the set of all w-values is contained in a union of countably many cosets g_iG_i where each G_i is in C, then the verbal subgroup w(G) is virtually-C. This strengthens several known results.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.