Abstract
Given a group word and a group , the set of -values in is denoted by and the verbal subgroup is the one generated by . In the present paper we consider profinite groups admitting a word such that the cardinality of is less than and is generated by finitely many -values. For several families of words we show that under these assumptions must be finite. Our results are related to the concept of conciseness of group words.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.