Generating minimally transitive permutation groups
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.