On the derived length of groups with some permutational property (Q2640702)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:2640702 |
scientific article; zbMATH DE number 4188076
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the derived length of groups with some permutational property |
scientific article; zbMATH DE number 4188076 |
Statements
On the derived length of groups with some permutational property (English)
0 references
1991
0 references
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)\).
0 references
groups of permutation property
0 references
property \(P_ n\)
0 references
rewritable groups
0 references
property \(Q_ n\)
0 references
metabelian
0 references
derived length
0 references
soluble groups
0 references
0.862411379814148
0 references
0.8448963761329651
0 references
0.8199849724769592
0 references