Abelian permutation groups with graphical representations
Mariusz Grech, Andrzej Kisielewicz

TL;DR
This paper characterizes abelian permutation groups that serve as automorphism groups of coloured graphs and digraphs, focusing on classes of 2-closed and 2*-closed groups, using basic permutation group properties.
Contribution
It provides the first characterization of 2-closed and 2*-closed abelian permutation groups in terms of fundamental group properties.
Findings
Characterization of abelian automorphism groups of coloured graphs and digraphs.
First description of 2-closed and 2*-closed abelian groups.
Use of classical Schur terminology for group classification.
Abstract
In this paper we characterize permutation groups that are automorphism groups of coloured graphs and digraphs and are abelian as abstract groups. This is done in terms of basic permutation group properties. Using Schur's classical terminology, what we provide is characterizations of the classes of 2-closed and -closed abelian permutation groups. This is the first characterization concerning these classes since they were defined.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
