paper

Disjoint direct product decomposition of permutation groups

arXiv:2004.11618 · doi:10.1016/j.jsc.2021.04.003

Abstract

Let be an intransitive group with orbits . Then certainly is a subdirect product of the direct product of its projections on each orbit, . Here we provide a polynomial time algorithm for computing the finest partition of the -orbits such that and demonstrate its usefulness in some applications.