Disjoint direct product decomposition of permutation groups
Group Theory
2021-12-02 v3
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.
Keywords
Cite
@article{arxiv.2004.11618,
title = {Disjoint direct product decomposition of permutation groups},
author = {Mun See Chang and Christopher Jefferson},
journal= {arXiv preprint arXiv:2004.11618},
year = {2021}
}