On primitive $2$-closed permutation groups of rank at most four
Combinatorics
2022-09-20 v2 Group Theory
Abstract
We characterise the primitive 2-closed groups of rank at most four that are not the automorphism group of a graph or digraph and show that if the degree is at least 2402 then there are just two infinite families or , the 1-dimensional affine semilinear group. These are the first known examples of non-regular 2-closed groups that are not the automorphism group of a graph or digraph.
Keywords
Cite
@article{arxiv.2110.07896,
title = {On primitive $2$-closed permutation groups of rank at most four},
author = {Michael Giudici and Luke Morgan and Jin-Xin Zhou},
journal= {arXiv preprint arXiv:2110.07896},
year = {2022}
}