Normalizers and permutational isomorphisms in simply-exponential time

04/24/2019
by   Daniel Wiebking, et al.
0

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).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/04/2020

Normalisers of primitive permutation groups in quasipolynomial time

We show that given generators for subgroups G and H of S_n, if G is prim...
research
11/02/2021

Regularization for Shuffled Data Problems via Exponential Family Priors on the Permutation Group

In the analysis of data sets consisting of (X, Y)-pairs, a tacit assumpt...
research
03/13/2017

Orbital Graphs

We introduce orbital graphs and discuss some of their basic properties. ...
research
05/15/2023

Algorithms for the Minimum Generating Set Problem

For a finite group G, the size of a minimum generating set of G is denot...
research
01/15/2020

Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding Approach

It can be shown that each permutation group G S_n can be embedded, in a...
research
05/11/2020

Towards Efficient Normalizers of Primitive Groups

We present the ideas behind an algorithm to compute normalizers of primi...
research
06/23/2020

Symmetries, graph properties, and quantum speedups

Aaronson and Ambainis (2009) and Chailloux (2018) showed that fully symm...

Please sign up or login with your details

Forgot password? Click here to reset