Search arXivSearch

arXiv · 1511.07843

Coverings of commutators in profinite groups

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 subgroups. It is natural to ask in what way the structure of the verbal subgroup $w(G)$ depends on the properties of the covering subgroups. The present article is a survey of recent results related to that question. In particular we survey results on finite and countable coverings of word-values (mostly commutators) by procyclic, abelian, nilpotent, and soluble subgroups, as well as subgroups with finiteness conditions. The last section of the paper is devoted to relation of the described results with Hall's problem on conciseness of group-words.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Cristina Acciarri, Pavel Shumyatsky. 2015-11-24. Coverings of commutators in profinite groups. https://arxiv.org/abs/1511.07843

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Margulis-Soifer theorem for one-relator groups

We establish the Margulis-Soifer dichotomy for one-relator groups: every one-relator group is either virtually solvable or has a maximal subgroup of infinite index. We also present examples of one-relator groups with and without free maximal subgroups of infinite index, as well as examples that possess both free and non-free infinite index maximal subgroups. Triviality of the Frattini subgroup is also shown for all non-solvable one-relator groups. We close the paper with a short list of questions.

math.GR

Finite quotients of spherical Artin groups

We show the smallest non-abelian quotients of spherical and affine Artin groups are isomorphic to the smallest non-abelian quotients of the corresponding Coxeter groups. We deduce irreducible spherical Artin groups are determined by their finite quotient groups.

math.GR

Cosets with constant characteristic polynomial

Let H be a linear group. We show that if there is an invertible matrix x such that all the elements of xH share the same characteristic polynomial then H is virtually solvable. There are plenty of applications that will be presented in future paper. Here, we discuss some applications to the generalized Weigold conjecture and present an alternative straightforward proof of the Formanek--Procesi nonlinearity theorem for Aut(F_n), n>2, over every field. When n>5 our non-linearity proof gives a stronger result than the original Formanek--Procesi theorem.

math.GR