- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- BIRS Workshop Lecture Videos /
- Normalisers of primitive permutation groups
Open Collections
BIRS Workshop Lecture Videos
BIRS Workshop Lecture Videos
Normalisers of primitive permutation groups Roney Dougal, Colva
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.
Item Metadata
Title |
Normalisers of primitive permutation groups
|
Creator | |
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 | |
Type | |
File Format |
video/mp4
|
Language |
eng
|
Notes |
Author affiliation: University of St Andrews
|
Series | |
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 | |
Affiliation | |
Peer Review Status |
Unreviewed
|
Scholarly Level |
Faculty
|
Rights URI | |
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International