Disjoint direct product decomposition of permutation groups
Abstract
Let H ≤ Sn be an intransitive group with orbits 1, 2, … ,k. Then certainly H is a subdirect product of the direct product of its projections on each orbit, H|_1 × H|_2 × … × H|_k. Here we provide a polynomial time algorithm for computing the finest partition P of the H-orbits such that H = Πc ∈ P H|c and demonstrate its usefulness in some applications.
0