A permutation group $G$ (acting on the set$\left\{1\,2\,\dots \,n\right\}$ is semi-regular if the stabilizer of any point is trivial. If, in addition, $G$ acts transitively, then it is said to be regular. This means that the action of $G$ is permutation isomorphic  to the action of $G$ on itself by (right) translation.

Every Abelian transitive permutation group is regular.

The IsRegular( G ) command returns true if the permutation group G is regular, and returns false otherwise. The IsSemiRegular( G ) command returns true if the permutation group G is semi-regular, and returns false otherwise. The group G must be an instance of a permutation group.

The dom option can be used to specify the domain on which G acts.

For regularity in the sense of P. Hall, for groups of prime power order, see GroupTheory[IsRegularPGroup].

$\mathrm{with}\left(\mathrm{GroupTheory}\right)\:$

$G≔\mathrm{Group}\left(\left\{\mathrm{Perm}\left(\left[\left[1\,2\right]\right]\right)\,\mathrm{Perm}\left(\left[\left[1\,2\,3\right]\,\left[4\,5\right]\right]\right)\right\}\right)$

$G≔⟨\left(1\,2\right)\,\left(1\,2\,3\right)\left(4\,5\right)⟩$

$\mathrm{IsRegular}\left(G\right)$

$\mathrm{false}$

$\mathrm{IsRegular}\left(\mathrm{CyclicGroup}\left(6\right)\right)$

$\mathrm{true}$

$\mathrm{IsRegular}\left(\mathrm{CyclicGroup}\left(6\,\':-\mathrm{mindegree}\'\right)\right)$

$\mathrm{false}$

$G≔\mathrm{Group}\left(\left\{\mathrm{Perm}\left(\left[\left[1\,2\right]\,\left[3\,4\right]\right]\right)\right\}\right)$

$G≔⟨\left(1\,2\right)\left(3\,4\right)⟩$

$\mathrm{IsSemiRegular}\left(G\right)$

$\mathrm{true}$

$\mathrm{IsRegular}\left(G\right)$

$\mathrm{false}$

$G≔\mathrm{Group}\left(\left\{\mathrm{Perm}\left(\left[\left[1\,2\right]\,\left[3\,4\,5\right]\right]\right)\right\}\right)$

$G≔⟨\left(1\,2\right)\left(3\,4\,5\right)⟩$

$\mathrm{IsSemiRegular}\left(G\right)$

$\mathrm{false}$

$G≔\mathrm{Group}\left(\left[\mathrm{Perm}\left(\left[\left[2\,3\,4\right]\right]\right)\,\mathrm{Perm}\left(\left[\left[2\,3\right]\right]\right)\right]\right)$

$G≔⟨\left(2\,3\,4\right)\,\left(2\,3\right)⟩$

$\mathrm{IsSemiRegular}\left(G\right)$

$\mathrm{false}$

$\mathrm{IsSemiRegular}\left(\mathrm{Group}\left(\left[\mathrm{Perm}\left(\left[\left[2\,3\,4\right]\right]\right)\,\mathrm{Perm}\left(\left[\left[5\,6\,7\right]\right]\right)\right]\right)\right)$

$\mathrm{false}$

$G≔\mathrm{Group}\left(\left\{\mathrm{Perm}\left(\left[\left[1\,2\,3\right]\,\left[4\,5\,6\right]\right]\right)\right\}\right)$

$G≔⟨\left(1\,2\,3\right)\left(4\,5\,6\right)⟩$

$\mathrm{IsSemiRegular}\left(G\right)$

$\mathrm{true}$

$G≔\mathrm{Group}\left(\left\{\mathrm{Perm}\left(\left[\left[1\,2\,3\right]\right]\right)\,\mathrm{Perm}\left(\left[\left[4\,5\,6\right]\right]\right)\right\}\right)$

$G≔⟨\left(1\,2\,3\right)\,\left(4\,5\,6\right)⟩$

$\mathrm{IsSemiRegular}\left(G\right)$

$\mathrm{false}$

$\mathrm{IsRegular}\left(G\,\left\{1\,2\,3\right\}\right)$

$\mathrm{true}$

$\mathrm{IsRegular}\left(G\,\left\{4\,5\,6\right\}\right)$

$\mathrm{true}$

$\mathrm{IsRegular}\left(\mathrm{Symm}\left(3\right)\right)$

$\mathrm{false}$

$\mathrm{IsRegular}\left(\mathrm{TransitiveGroup}\left(6\,2\right)\right)$

$\mathrm{true}$

$\mathrm{AreIsomorphic}\left(\mathrm{Symm}\left(3\right)\,\mathrm{TransitiveGroup}\left(6\,2\right)\right)$

$\mathrm{true}$

$\mathrm{AreIsomorphic}\left(\mathrm{TransitiveGroup}\left(8\,5\right)\,\mathrm{QuaternionGroup}\left(\right)\right)$

$\mathrm{true}$

$\mathrm{IsRegular}\left(\mathrm{TransitiveGroup}\left(8\,5\right)\right)$

$\mathrm{true}$

$G≔\mathrm{DirectProduct}\left(\mathrm{TransitiveGroup}\left(8\,5\right)\,\mathrm{TransitiveGroup}\left(8\,5\right)\right)$

$G≔\mathrm{<\; a\; permutation\; group\; on\; 16\; letters\; with\; 4\; generators\; >}$

$\mathrm{IsSemiRegular}\left(G\right)$

$\mathrm{false}$

$\mathrm{gens}≔\mathrm{Generators}\left(G\right)\&colon;$

$H≔\mathrm{Subgroup}\left(\left\{\mathrm{`.`}\left({\mathrm{gens}}_1\&comma;{\mathrm{gens}}_3\right)\&comma;\mathrm{`.`}\left({\mathrm{gens}}_2\&comma;{\mathrm{gens}}_4\right)\right\}\&comma;G\right)$

$H≔⟨\left(1\&comma;2\&comma;3\&comma;8\right)\left(4\&comma;5\&comma;6\&comma;7\right)\left(9\&comma;10\&comma;11\&comma;16\right)\left(12\&comma;13\&comma;14\&comma;15\right)\&comma;\left(1\&comma;7\&comma;3\&comma;5\right)\left(2\&comma;6\&comma;8\&comma;4\right)\left(9\&comma;15\&comma;11\&comma;13\right)\left(10\&comma;14\&comma;16\&comma;12\right)⟩$

$\mathrm{AreIsomorphic}\left(H\&comma;\mathrm{QuaternionGroup}\left(\right)\right)$

$\mathrm{true}$

$\mathrm{IsSemiRegular}\left(H\right)$

$\mathrm{true}$

$\mathrm{IsRegular}\left(\mathrm{FrobeniusGroup}\left(15000\&comma;3\right)\right)$

$\mathrm{false}$

$\mathrm{it}≔\mathrm{AllTransitiveGroups}\left(34\&comma;\&apos;\mathrm{output}\&apos;\&equals;''iterator''\right)$

$\mathrm{it}≔\mathrm{\&lang;Transitive\; Groups\; Iterator:\; 34/1\; ..\; 34/115\&rang;}$

$A≔\mathrm{Array}\left(\left[\right]\right)\&colon;$

$\mathbf{for}\mathrm{id}\&comma;G\mathbf{in}\mathrm{it}\mathbf{do}\mathbf{if}\mathrm{IsSemiRegular}\left(G\right)\mathbf{then}\mathrm{`,=`}\left(A\&comma;\left[\mathrm{id}\right]\right)\mathbf{end\; if}\mathbf{end\; do}\&colon;$

$\left[\mathrm{seq}\right]\left(A\right)$

$\left[\left[34\&comma;1\right]\&comma;\left[34\&comma;2\right]\right]$