9, Theorem (b)(I)]) Let G be a primitive permutation group
of odd degree n, acting on a set [OMEGA] with simple socle X = Soc(G), and let H = [G.
0,k](n) is equal to the number of elements in the colored permutation group
3], the permutation group
in tree elements, preserves the configuration of six points in Fig.
1]), and the generalized permutation group
is [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].
r](Q) is a normal subgroup, then the equivalence relation induced by the orbits ofthe right-regular permutation group
The orbital profile of a permutation group
G acting on a set E is the function [[theta].
1 (Cayley Theorem) Every group is isomorphic to a permutation group
P^ coincides with the permutation group
, then all the members of
Let G be a sharply 2-transitive permutation group
on a set [OMEGA] with #[OMEGA] [greater than or equal to] 2.
This outcome is sufficient in the recursive procedure of matrix recognition, because a homomorphism of G into the permutation group
Sym(k) can be computed.
Let n a positive integer and G a permutation group
G [subset] [G.
Given: a permutation group
G [less than or equal to] Sym([OMEGA]) and a subset [DELTA] [subset or equal to] [OMEGA].