On the derived length of groups with some permutational property

DOI10.1016/0021-8693(91)90066-HMaRDI QIDQ2640702zbMATH OpenFDO

Authors M. Maj

Publication date 1991

Published in Journal of Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0021-8693(91)90066-H

zbMATH Keywords

derived lengthgroups of permutation propertymetabelianproperty \(P_ n\)property \(Q_ n\)rewritable groupssoluble groups

Mathematics Subject Classification ID

Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Quasivarieties and varieties of groups (20E10) Generators, relations, and presentations of groups (20F05) Commutator calculus (20F12) Solvable groups, supersolvable groups (20F16) FC-groups and their generalizations (20F24)

Review text

A group G has property \(Q_ n\) if for every choice \(x_ 1,...,x_ n\in G\) there exist distinct permutations \(\sigma\), \(\tau\) in \(S_ n\) such that \[ x_{\sigma (1)}...x_{\sigma (n)}=x_{\tau (1)}...x_{\tau (n)}. \] If one can always choose \(\tau =1\), then G is said to have \(P_ n\). It is shown that groups with \(Q_ 3\) are metabelian. Moreover, the derived length of soluble groups with \(Q_ n\) (resp. \(P_ n)\) is \(\leq (n-2)^ 2(n+1)/2\) (resp. \(\leq 2n-6)\). The latter is one of the few results in this area that are valid for all n. It seems open whether the bounds given are best possible for \(n\geq 4\) (resp. \(n\geq 5)\).

Recommendations

• Rewriting products of group elements. I
• A permutational property of groups
• scientific article; zbMATH DE number 5073440
• General bounds for permutability in finite groups
• scientific article; zbMATH DE number 4055889

Cites work

• A permutational property of groups
• Groups Covered By Permutable Subsets
• scientific article; zbMATH DE number 3838303 (Why is no real title available?)
• scientific article; zbMATH DE number 4083918 (Why is no real title available?)
• On groups in which every product of four elements can be reordered
• On the 4-permutational property
• On the Burnside problem for semigroups
• Rewriting products of group elements. I

Cited in

(14)

• Rewriting products of group elements. I
• Some remarks on \(P_ n\)-sequenceable groups
• A property equivalent to \(n\)-permutability for infinite groups
• Groups with many rewritable products.
• On 3-rewritable groups.
• Characterization of 3-Rewritable Finite Nilpotent Groups
• Rewritable groups.
• Some remarks on groups with permutable subgroup products
• scientific article; zbMATH DE number 1076134 (Why is no real title available?)
• scientific article; zbMATH DE number 1109636 (Why is no real title available?)
• Semisimple groups with the rewriting property Q₅
• 3-Rewritable Nilpotent 2-Groups of Class 2^#
• A permutational property of groups
• Characterization of Abelian-by-cyclic 3-rewritable groups.

This page was built for publication: On the derived length of groups with some permutational property

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2640702)