Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Normalisers of primitive permutation groups in quasipolynomial time

Normalisers of primitive permutation groups in quasipolynomial time We show that given generators for subgroups G and H of Sn, if G is primitive then generators for NH(G) may be computed in quasipolynomial time, namely 2O(log3n). The previous best known bound was simply exponential. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Bulletin of the London Mathematical Society Wiley

Normalisers of primitive permutation groups in quasipolynomial time

Loading next page...
 
/lp/wiley/normalisers-of-primitive-permutation-groups-in-quasipolynomial-time-WPJP00207v

References (17)

Publisher
Wiley
Copyright
© 2020 London Mathematical Society
ISSN
0024-6093
eISSN
1469-2120
DOI
10.1112/blms.12330
Publisher site
See Article on Publisher Site

Abstract

We show that given generators for subgroups G and H of Sn, if G is primitive then generators for NH(G) may be computed in quasipolynomial time, namely 2O(log3n). The previous best known bound was simply exponential.

Journal

Bulletin of the London Mathematical SocietyWiley

Published: Apr 1, 2020

Keywords: ;

There are no references for this article.