Minimal generating sets of maximal size in finite monolithic groups.

DOI10.1007/S00013-013-0583-3MaRDI QIDQ387610zbMATH OpenOpenAlexFDO

Authors Andrea Lucchini

Publication date 23 December 2013

Published in Archiv der Mathematik (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00013-013-0583-3

zbMATH Keywords

finite monolithic groupsgenerating setsnumbers of generators

Mathematics Subject Classification ID

Arithmetic and combinatorial problems involving abstract finite groups (20D60) Generators, relations, and presentations of groups (20F05)

Review text

Let \(G\) be a finite group and \(X\) be a generating set for \(G\). Then \(X\) is called a minimal generating set for \(G\) if no proper subset of \(X\) generates \(G\). The largest size of a minimal generating set for \(X\) is denoted by \(m(G)\). The aim of the present paper is to give an estimate for \(m(G)-m(G/N)\), where \(G\) is a primitive monolithic group with the unique minimal normal subgroup \(N\).

Recommendations

• Bounding the maximal size of independent generating sets of finite groups
• The largest size of a minimal generating set of a finite group.
• The maximal size of a minimal generating set
• Comonolithic subnormal subgroups generating a finite group
• Large minimal invariable generating sets in the finite symmetric groups

Cites work

• Classes of Finite Groups
• Crowns and factorization of the probabilistic zeta function of a finite group.
• Generating wreath products
• Generating wreath products and their augmentation ideals
• Generators and minimal normal subgroups
• Independent generating sets and geometries for symmetric groups
• Maximal independent generating sets of the symmetric group
• On the maximal size of independent generating sets of \(\text{PSL}_2(q)\)
• The largest size of a minimal generating set of a finite group.
• Walks on generating sets of groups
• What do we know about the product replacement algorithm?

Cited in

(20)

• On the maximal size of independent generating sets of \(\text{PSL}_2(q)\)
• Flexibility in generating sets of finite groups
• Independent sets of generators of prime power order
• Minimal invariable generating sets
• Maximal subgroups of finite groups avoiding the elements of a generating set
• Decompositions of elements of monomial groups over finite fields over minimal bases
• Probabilistic generation of finite groups with a unique minimal normal subgroup.
• The largest size of a minimal generating set of a finite group.
• On the probability of generating a monolithic group.
• Bounding the maximal size of independent generating sets of finite groups
• Minimal generating sets of the monoid of partial order-preserving injections
• scientific article; zbMATH DE number 5498828 (Why is no real title available?)
• FINITE GROUPS WITH INDEPENDENT GENERATING SETS OF ONLY TWO SIZES
• The maximal size of a minimal generating set
• Minimal generating sequences of \(\mathfrak{F}\)-subgroups
• Large minimal invariable generating sets in the finite symmetric groups
• On finite solvable groups G with m(G) - d(G) = 1
• Lifting generators in connected Lie groups
• On the probability of generating finite groups with a unique minimal normal subgroup.
• Maximal subgroups of finite soluble groups in general position

This page was built for publication: Minimal generating sets of maximal size in finite monolithic groups.

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