Two-closure of supersolvable permutation group in polynomial time
Ilia Ponomarenko,
Andrey Vasil'ev
Abstract:The 2-closure G of a permutation group G on Ω is defined to be the largest permutation group on Ω, having the same orbits on Ω × Ω as G. It is proved that if G is supersolvable, then G can be found in polynomial time in |Ω|. As a byproduct of our technique, it is shown that the composition factors of G are cyclic or alternating.
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.