Title	Normalisers of primitive permutation groups
Creator	Roney Dougal, Colva
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2019-08-28T10:30
Description	We present a new approach to computing the normaliser of a primitive group G in an arbitrary subgroup H of S_n. Our method runs in quasipolynomial time O(2^{\log^3 n}), whereas the previous best known algorithm was simply exponential. The main tools used are Babaiâ s recent breakthrough on the graph isomorphism problem, and results on the base size, the order, and the minimal number of generators of a primitive group.
Extent	31.0 minutes
Subject	Mathematics; Group theory and generalizations; Geometry; Algebraic structures
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: University of St Andrews
Series	BIRS Workshop Lecture Videos (Banff, Alta)
Date Available	2020-02-25
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0388701
URI	http://hdl.handle.net/2429/73598
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Faculty
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos