Minimal sized generating sets of permutation groups

We present a randomised variant of an algorithm of Lucchini and Thakkar [10] for finding a smallest sized generating set in a finite group, which has polynomial time expected running time in finite permutation groups.

Authors

Institutions

Publication Details

Journal
Journal of Algebra
Published
2025-09-01
DOI
https://doi.org/10.1016/j.jalgebra.2025.09.001
Primary Topic
Finite Group Theory Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Minimal sized generating sets of permutation groups

Gareth Tracey, Derek F. Holt
Journal of Algebra
Finite Group Theory Research
article

Minimal sized generating sets of permutation groups

Gareth Tracey, Derek F. Holt
article en

Abstract

We present a randomised variant of an algorithm of Lucchini and Thakkar [10] for finding a smallest sized generating set in a finite group, which has polynomial time expected running time in finite permutation groups.

Journal of Algebra
University of Warwick (GB)
Openalex Percentile: Top 70%
Finite Group Theory Research
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Minimal sized generating sets of permutation groups — Gareth Tracey, Derek F. Holt · Journal of Algebra (2025) | TGRS Research Map | TGRS