Work

Normalisers of primitive permutation groups in quasipolynomial time

Year: 2020

Type: article

Abstract: We show that given generators for subgroups G and H of S n , if G is primitive then generators for N H ( G ) may be computed in quasipolynomial time, namely 2 O ( log 3 n ) . The previous best known bound was simply exponential.

Source: Bulletin of the London Mathematical Society

DOI: 10.1112/blms.12330

Authors: Colva M. Roney‐Dougal, Sergio Siccha

Institutions: University of St Andrews, RWTH Aachen University

Language: English

Topic: Finite Group Theory Research

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: green

Funders: Deutsche Forschungsgemeinschaft, Engineering and Physical Sciences Research Council, Division of Mathematical Sciences

Awards: G2203179303, G3341554066, G3691759950, Isaac Newton Institute for Mathematical Sciences

OpenAlex ID: W3015965709

FWCI: 1.746

Cites: 14

Cited by: 4

Related to: