On conciseness of the word in Olshanskii's example
Matteo Pintonello, Pavel Shumyatsky

TL;DR
This paper investigates the conciseness properties of a specific group-word in different classes of groups, proving it is concise in residually finite groups and strongly concise in profinite groups.
Contribution
It demonstrates that Olshanskii's non-concise word is actually concise in residually finite groups and strongly concise in profinite groups, clarifying its behavior in these classes.
Findings
The word is concise in residually finite groups.
The word is strongly concise in profinite groups.
Conciseness depends on the class of groups considered.
Abstract
A group-word is called concise if the verbal subgroup is finite whenever takes only finitely many values in a group . It is known that there are words that are not concise. In particular, Olshanskii gave an example of such a word, which we denote by . The problem whether every word is concise in the class of residually finite groups remains wide open. In this note we observe that is concise in residually finite groups. Moreover, we show that is strongly concise in profinite groups, that is, is finite whenever is a profinite group in which takes less than values.
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
Topicssemigroups and automata theory · Finite Group Theory Research · Coding theory and cryptography
