Projects per year
Abstract
The spread of a group G is the greatest number r such that, for every set of non-trivial elements {x1,…,xr}, there exists an element y with the property that xs3008xi, yxs3009 = G for 1 ≤ i ≤ r. In this paper we obtain good upper bounds for the spread of fourteen sporadic simple groups computationally, and we determine the value of the spread of M11 by hand.
Original language | English |
---|---|
Pages (from-to) | 132-140 |
Journal | LMS Journal of Computation and Mathematics |
Volume | 10 |
DOIs | |
Publication status | Published - 2007 |
Fingerprint
Dive into the research topics of 'Improved bounds for the spread of sporadic groups'. Together they form a unique fingerprint.Projects
- 2 Finished
-
EP/C523229/1: Multidisciplinary Critical Mass in Computational Algebra and Applications
Ruskuc, N. (PI) & Quick, M. (CoI)
1/09/05 → 31/08/10
Project: Standard
-
EP/C523229/1: Multidisciplinary Critical Mass in Computational Algebra and Applications
Linton, S. A. (PI), Gent, I. P. (CoI), Leonhardt, U. (CoI), Mackenzie, A. (CoI), Miguel, I. J. (CoI), Quick, M. (CoI) & Ruskuc, N. (CoI)
1/09/05 → 31/08/10
Project: Standard