Abstract
We demonstrate a number of hard permutation group algorithmic problems, such as Group Intersection and Setwise Stabilizer, which become polynomially equivalent to the Graph Isomorphism Problem after restricting them to 2-closed permutation groups. It is shown that these problems are closely related to problems concerning coherent configurations. We also present a polynomial-time procedure for determining the 2-closure of a nilpotent group. This procedure provides a polynomial-time reduction of the 2-closure problem for odd order groups to the same problem for primitive odd order groups.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Applicable Algebra in Engineering, Communication and Computing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
