Subgroups of minimal index in polynomial time

DOI10.1142/S0219498820500103zbMath1481.20089arXiv1807.11773OpenAlexW2963991484WikidataQ114614760 ScholiaQ114614760MaRDI QIDQ4960483

Saveliĭ Vyacheslavovich Skresanov

Publication date: 23 April 2020

Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.11773

zbMATH Keywords

minimal permutation representationpermutation group algorithmsgroup representability on treesgroup representability problemsubgroup of minimal index

Mathematics Subject Classification ID

Arithmetic and combinatorial problems involving abstract finite groups (20D60) Maximal subgroups (20E28) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) General theory for finite permutation groups (20B05) Computational methods for problems pertaining to group theory (20-08)

Cites Work

• Unnamed Item
• Minimal permutation representation of Thompson's simple group
• The degree and index of a finite group
• Generation and random generation: from simple groups to maximal subgroups.
• On the maximum orders of elements of finite almost simple groups and primitive permutation groups
• Representing Groups on Graphs

This page was built for publication: Subgroups of minimal index in polynomial time