Strong conciseness of coprime and anti-coprime commutators
Eloisa Detomi, Marta Morigi, Pavel Shumyatsky

TL;DR
This paper investigates the structure of profinite groups by analyzing the cardinality of specific types of commutators, establishing conditions under which the groups are finite-by-pronilpotent or have finite commutator subgroup.
Contribution
It proves that small sets of coprime or anti-coprime commutators imply significant structural properties in profinite groups.
Findings
Profinite groups with less than continuum coprime commutators are finite-by-pronilpotent.
Groups with fewer than continuum anti-coprime commutators have finite commutator subgroup.
The results connect commutator set size to profound group-theoretic properties.
Abstract
A coprime commutator in a profinite group is an element of the form , where and have coprime order and an anti-coprime commutator is a commutator such that the orders of and are divisible by the same primes. In the present paper we establish that a profinite group is finite-by-pronilpotent if the cardinality of the set of coprime commutators in is less than . Moreover, a profinite group has finite commutator subgroup if the cardinality of the set of anti-coprime commutators in is less than .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · graph theory and CDMA systems · Coding theory and cryptography
