Outer commutator words are uniformly concise

Details Outer commutator words are uniformly concise Outer commutator words are uniformly concise

2009-11-16

arxiv.org/abs/0911.3048v1

Mathematics

Group Theory

Scientific paper

We prove that outer commutator words are uniformly concise, i.e. if an outer commutator word w takes m different values in a group G, then the order of the verbal subgroup w(G) is bounded by a function depending only on m and not on w or G. This is obtained as a consequence of a structure theorem for the subgroup w(G), which is valid if G is soluble, and without assuming that w takes finitely many values in G. More precisely, there is an abelian series of w(G), such that every section of the series can be generated by values of w all of whose powers are also values of w in that section. For the proof of this latter result, we introduce a new representation of outer commutator words by means of binary trees, and we use the structure of the trees to set up an appropriate induction.

Affiliated with

Also associated with

No associations

Rating

Outer commutator words are uniformly concise does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Outer commutator words are uniformly concise, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Outer commutator words are uniformly concise will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-499309