Colin M. Campbell

Colin M. Campbell

Auto-generated profile, based on publicly available information

Colin M. Campbell

Univ St Andrews, Sch Math & Stat, St Andrews KY16 9SS, Fife, Scotland

Research Focus & Metrics

Academic Career Length

35Years (1992-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2001 in Theoretical Computer Science
Verified
Journal Article
Closed access
CCColin M. Campbell
Colin M. Campbell
EREdmund F. Robertson
Edmund F. Robertson
NRNikola Ruškuc
Nikola Ruškuc
RTRichard M. Thomas
Richard M. Thomas

3 November 1994
Verified
Book Chapter
Closed access
CCC M Campbell
C M Campbell
ERE F Robertson
E F Robertson
NRN Ruškuc
N Ruškuc
RTR M Thomas
R M Thomas
Combinatorial and Geometric Group Theory, Edinburgh 1993 - November 1994

1 December 1995 in Semigroup Forum
Verified
Journal Article
Closed access
PDF file
CCC. M. Campbell
C. M. Campbell
ERE. F. Robertson
E. F. Robertson
NRN. Ruškuc
N. Ruškuc
RTR. M. Thomas
R. M. Thomas

1 January 1995 in Bulletin of the London Mathematical Society
Verified
Journal Article
Closed access
CCC. M. Campbell
C. M. Campbell
ERE. F. Robertson
E. F. Robertson
NRN. Ruškuc
N. Ruškuc
RTR. M. Thomas
R. M. Thomas

1 December 2011 in Algebra Colloquium
Verified
Journal Article
Closed access
PDF file
ÖDÖmür Deveci
Ömür Deveci
EKErdal Karaduman
Erdal Karaduman
CCColin M. Campbell
Colin M. Campbell

1 January 2004 in LMS Journal of Computation and Mathematics
Verified
Journal Article
Open access
PDF file
CCColin M. Campbell
Colin M. Campbell
GHGeorge Havas
George Havas
CRColin Ramsay
Colin Ramsay
EREdmund F. Robertson
Edmund F. Robertson
Prior to this paper, all small simple groups were known to be efficient, but the status of four of their covering groups was unknown. Nice, efficient presentations are provided in this paper for all of these groups, resolving the previously unknown cases. The authors‘presentations are better than those that were previously available, in terms of both length and computational properties. In many cases, these presentations have minimal possible length. The results presented here are based on major amounts of computation. Substantial use is made of systems for computational group theory and, in partic-ular, of computer implementations of coset enumeration. To assist in reducing the number of relators, theorems are provided to enable the amalgamation of power relations in certain presentations. The paper concludes with a selection of unsolved problems about efficient presentations for simple groups and their covers.