Towards Efficient Normalizers of Primitive Groups

05/11/2020
by   Sergio Siccha, et al.
0

We present the ideas behind an algorithm to compute normalizers of primitive groups with non-regular socle in polynomial time. We highlight a concept we developed called permutation morphisms and present timings for a partial implementation of our algorithm. This article is a collection of results from the author's PhD thesis.

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
04/14/2023

Decoding twisted permutation codes

We consider twisted permutation codes, a class of frequency permutation ...
research
01/18/2022

A Computation Model with Automatic Functions and Relations as Primitive Operations

Prior work of Hartmanis and Simon (Hartmanis and Simon, 1974) and Floyd ...
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
04/24/2019

Normalizers and permutational isomorphisms in simply-exponential time

We show that normalizers and permutational isomorphisms of permutation g...
research
06/23/2020

Symmetries, graph properties, and quantum speedups

Aaronson and Ambainis (2009) and Chailloux (2018) showed that fully symm...
research
09/12/2017

Optimal On The Fly Index Selection in Polynomial Time

The index selection problem (ISP) is an important problem for accelerati...

Please sign up or login with your details

Forgot password? Click here to reset