The Derived Subgroups of Sylow 2-Subgroups of the Alternating Group, Commutator Width of Wreath Product of Groups

The structure of the commutator subgroup of Sylow 2-subgroups of an alternating group A 2 k is determined. This work continues the previous investigations of me, where minimal generating sets for Sylow 2-subgroups of alternating groups were constructed. Here we study the commutator subgroup of these groups. The minimal generating set of the commutator subgroup of A 2 k is constructed. It is shown that ( S y l 2 A 2 k ) 2 = S y l 2 ′ A 2 k , k > 2 . It serves to solve quadratic equations in this group, as were solved by Lysenok I. in the Grigorchuk group. It is proved that the commutator length of an arbitrary element of the iterated wreath product of cyclic groups C p i , p i ∈ N equals to 1. The commutator width of direct limit of wreath product of cyclic groups is found. Upper bounds for the commutator width ( c w ( G ) ) of a wreath product of groups are presented in this paper. A presentation in form of wreath recursion of Sylow 2-subgroups S y l 2 ( A 2 k ) of A 2 k is introduced. As a result, a short proof that the commutator width is equal to 1 for Sylow 2-subgroups of alternating group A 2 k , where k > 2 , the permutation group S 2 k , as well as Sylow p-subgroups of S y l 2 A p k as well as S y l 2 S p k ) are equal to 1 was obtained. A commutator width of permutational wreath product B ≀ C n is investigated. An upper bound of the commutator width of permutational wreath product B ≀ C n for an arbitrary group B is found. The size of a minimal generating set for the commutator subgroup of Sylow 2-subgroup of the alternating group is found. The proofs were assisted by the computer algebra system GAP.

Commutator width of Chevalley groups over rings of stable rank 1

It is shown that each element of the elementary Chevalley group of rank greater than 2 over a ring of stable rank 1 can be expressed as a product of few commutators.

Generation of relative commutator subgroups in Chevalley groups

Let Φ be a reduced irreducible root system of rank greater than or equal to 2, let R be a commutative ring and let I, J be two ideals of R. In the present paper we describe generators of the commutator groups of relative elementary subgroups [E(Φ,R,I),E(Φ,R,J)] both as normal subgroups of the elementary Chevalley group E(Φ,R), and as groups. Namely, let xα(ξ), α ∈ Φ ξ ∈ R, be an elementary generator of E(Φ,R). As a normal subgroup of the absolute elementary group E(Φ,R), the relative elementary subgroup is generated by xα(ξ), α ∈ Φ, ξ ∈ I. Classical results due to Stein, Tits and Vaserstein assert that as a group E(Φ,R,I) is generated by zα(ξ,η), where α ∈ Φ, ξ ∈ I, η ∈ R. In the present paper, we prove the following birelative analogues of these results. As a normal subgroup of E(Φ,R) the relative commutator subgroup [E(Φ,R,I),E(Φ,R,J)] is generated by the following three types of generators: (i) [xα(ξ),zα(ζ,η)], (ii) [xα(ξ),x_α(ζ)] and (iii) xα(ξζ), where α ∈ Φ, ξ ∈ I, ζ ∈ J, η ∈ R. As a group, the generators are essentially the same, only that type (iii) should be enlarged to (iv) zα(ξζ,η). For classical groups, these results, with many more computational proofs, were established in previous papers by the authors. There is already an amazing application of these results in the recent work of Stepanov on relative commutator width.

Palindromic words in simple groups

A palindrome is a word that reads the same left-to-right as right-to-left. We show that every simple group has a finite generating set X, such that every element of it can be written as a palindrome in the letters of X. Moreover, every simple group has palindromic width pw(G, X) = 1, where X only differs by at most one additional generator from any given generating set. On the contrary, we prove that all non-abelian finite simple groups G also have a generating set S with pw(G, S) > 1. As a by-product of our work we also obtain that every just-infinite group has finite palindromic width with respect to a finite generating set. This provides first examples of groups with finite palindromic width but infinite commutator width.

FINITELY GENERATED INFINITE SIMPLE GROUPS OF INFINITE SQUARE WIDTH AND VANISHING STABLE COMMUTATOR LENGTH

It is shown that there exist finitely generated infinite simple groups of infinite commutator width and infinite square width on which there exists no stably unbounded conjugation-invariant norm, and in particular stable commutator length vanishes. Moreover, a recursive presentation of such a group with decidable word and conjugacy problems is constructed.