On finiteness of some verbal subgroups in profinite groups

Given a group word w and a group G, the set of w-values in G is denoted by and the verbal subgroup is the one generated by . In the present paper we consider profinite groups admitting a word w such that the cardinality of is less than and is generated by finitely many w-values. For several families of words w we show that under these assumptions must be finite. Our results are related to the concept of conciseness of group words