Generating Permutation Groups

DOI10.1081/AGB-120029899MaRDI QIDQ3155509zbMATH OpenOpenAlexFDO

Authors Andrea Lucchini, F. Menegazzo, Marta Morigi

Publication date 17 January 2005

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

Full work available at URL https://doi.org/10.1081/agb-120029899

zbMATH Keywords

algorithmsfinite permutation groupsgenerators

Mathematics Subject Classification ID

Subgroups of symmetric groups (20B35) Generators, relations, and presentations of groups (20F05) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 475368
• Minimal and random generation of permutation and matrix groups.
• A strong generating test and short presentations for permutation groups
• The probability of generating a permutation group.
• Efficient representation of perm groups

Cites work

• A compact representation for permutation groups
• Chains of subgroups in symmetric groups
• Computing a set of generators of minimal cardinality in a solvable group
• ENUMERATING FINITE GROUPS
• scientific article; zbMATH DE number 3906699 (Why is no real title available?)
• Minimal degree for a permutation representation of a classical group
• Zu einem von B. H. und H. Neumann gestellten Problem

Cited in

(3)

• The smallest known length of an ordered system of generators of a symmetric group.
• Generating minimally transitive permutation groups.
• scientific article; zbMATH DE number 1236313 (Why is no real title available?)

This page was built for publication: Generating Permutation Groups

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