Normalizers and permutational isomorphisms in simply-exponential time
Daniel Wiebking
2020Year
5Citations
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).
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Related papers
- The Minimal Faithful Permutation Degree of Groups without Abelian Normal SubgroupsBireswar Das, Dhara ThakkarSTOC 2024 · 2 citations
- Faster Isomorphism for 𝑝-Groups of Class 2 and Exponent 𝑝Xiaorui SunSTOC 2023 · 6 citations
- On the Weisfeiler-Leman Dimension of Finite GroupsJendrik Brachter, Pascal SchweitzerLICS 2020 · 9 citations
- Canonical Forms for Matrix Tuples in Polynomial TimeYouming Qiao, Xiaorui SunFOCS 2024 · 1 citation
- Group isomorphism is nearly-linear time for most ordersHeiko Dietrich, James B. WilsonFOCS 2021 · 11 citations
