Normalizers and permutational isomorphisms in simply-exponential time
Abstract
We show that normalizers and permutational isomorphisms of permutation groups given by generating sets can be computed in time simply exponential in the degree of the groups. The result is obtained by exploiting canonical forms for permutation groups (up to permutational isomorphism).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.