Generating minimally transitive permutation groups
classification
🧮 math.GR
keywords
minimallypermutationtransitiveboundsdegreeelementsgenerategenerating
read the original abstract
We improve the upper bounds (in terms of $n$) in [9] and [13] on the minimal number of elements required to generate a minimally transitive permutation group of degree $n$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.