Normalizers and permutational isomorphisms in simply-exponential time
Data Structures and Algorithms
2019-06-11 v1 Computational Complexity
Discrete Mathematics
Group Theory
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).
Keywords
Cite
@article{arxiv.1904.10454,
title = {Normalizers and permutational isomorphisms in simply-exponential time},
author = {Daniel Wiebking},
journal= {arXiv preprint arXiv:1904.10454},
year = {2019}
}
Comments
12 pages