On rational and concise words
Preprint
Abstract
A group-word w is called concise if whenever the set of w-values in a group G is finite it always follows that the verbal subgroup w(G) is finite. More generally, a word w is said to be concise in a class of groups X if whenever the set of w-values is finite for a group G in X, it always follows that w(G) is finite. P. Hall asked whether every word is concise. Due to Ivanov the answer to this problem is known to be negative. It is still an open problem whether every word is concise in the class of residually finite groups. A word w is rational if the number of solutions to the equation w=g is the same as the number of solutions to w=g^e for every finite group G and for every e relatively prime to |G|. We observe that any rational word is concise in the class of residually finite groups. Further we give a sufficient condition for rationality of a word. This is used to produce a new family of words that are concise in the class of residually finite groups.Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- On words that are concise in residually finite groupsJournal of Pure and Applied Algebra, 2014
- IMAGES OF WORD MAPS IN FINITE SIMPLE GROUPSGlasgow Mathematical Journal, 2013
- WORDS WITH FEW VALUES IN FINITE SIMPLE GROUPSThe Quarterly Journal of Mathematics, 2012
- Outer commutator words are uniformly conciseJournal of the London Mathematical Society, 2010
- On the verbal width of finitely generated pro-$p$ groupsRevista Matemática Iberoamericana, 2008
- On Outer-Commutator WordsCanadian Journal of Mathematics, 1974
- Finiteness Conditions for Verbal SubgroupsJournal of the London Mathematical Society, 1966