Algorithmic Recognition of Actions of 2-Homogeneous Groups on Pairs
This paper presents an algorithm for recognizing whether a given transitive permutation group is isomorphic to the induced action on unordered pairs of some 2-homogeneous group (that is, one whose induced action on unordered pairs is transitive). The algorithm explicitly constructs the 2-homogeneous group and the isomorphism in case one exists. The author begins by describing a subdivision of the 2-homogeneous groups into several classes (starting with affine type, further subdivided into even or odd characteristic, and almost simple groups, also further subdivided). The known classification of 2-transitive groups (consequence of the classification of finite simple groups) is used only to say that the author's explicit list of classes contains all the 2-homogeneous groups. The bulk of the paper is concerned with several clever subroutines, presented in great detail, which are used to constructively recognize the actions on pairs of the various classes of groups. The author also proves a fast asymptotic time bound for the algorithm, as well as discussing a practical implementation in GAP.
- Algorithms for fundamental invariants and equivariants of finite groups
- Algorithms for group actions in arbitrary characteristic and a problem in singularity theory
- Two algorithms in group theory
- Algorithms for group isomorphism via group extensions and cohomology
- Homology of certain sets of 2-subgroups of symmetric groups
- Some algorithms in invariant theory of finite groups
- A Recognition Algorithm For Classical Groups Over Finite Fields
- Algebraic actions of \(p\)-groups
- An algorithm for computing homology groups
- Algorithms for twisted conjugacy classes of polycyclic-by-finite groups
This page was built for publication: Algorithmic Recognition of Actions of 2-Homogeneous Groups on Pairs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4230663)
