Generating numbers for wreath products
type: Item
instance of: scholarly article
title: Generating numbers for wreath products
zbMATH Open document ID: 0827.20040
published in: Rendiconti del Seminario Matematico della Università di Padova
publication date: 1995-12-04T00:00:00Z
full work available at URL: http://www.numdam.org/item
full work available at URL: https://eudml.org/doc/108345
review text: 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\).
Mathematics Subject Classification ID: 20E22
Mathematics Subject Classification ID: 20F05
zbMATH DE Number: 763294
zbMATH Keywords: number of generators
zbMATH Keywords: wreath products
author: Cliff David
reviewed by: Piroska Lakatos
MaRDI profile type: Publication
cites work: Growth sequences of finite groups
cites work: Q5512231
Recommended article: Generating wreath products
Recommended article: Generating wreath products of symmetric and alternating groups
Recommended article: Finite generation of iterated wreath products.
Recommended article: Q4721897
Recommended article: Enumerating wreath products via Garsia-Gessel bijections
Recommended article: Generalized wreath products
Recommended article: Invariable generation and wreath products
Recommended article: Generators and relations for wreath products
Recommended article: Enumerating representations in finite wreath products
Recommended article: Wreath products of permutation classes
description: scientific article; zbMATH DE number 763294