Generating numbers for wreath products (Q1891519): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
Property / author | |||
Property / author: Cliff David / rank | |||
Property / reviewed by | |||
Property / reviewed by: Piroska Lakatos / rank | |||
Revision as of 19:06, 19 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Generating numbers for wreath products |
scientific article |
Statements
Generating numbers for wreath products (English)
0 references
4 December 1995
0 references
For any group \(G\), \(d(G)\) denotes the minimal number of generators. For groups \(A\), \(B\), \(A\wr B\) denotes the wreath product of \(A\) by \(B\). The author proves the following Theorem: For every positive integer \(m\) there exists a group \(A\) with \(d(A)=m\) and a cyclic group \(B\) such that \(d(A\wr B)=2\).
0 references
number of generators
0 references
wreath products
0 references