-
Derek Holt, University of Warwick
-
Steve Linton, University of St. Andrews
-
Colva Roney-Dougal, University of St. Andrews
About:
The aims of this workshop were to ascertain the current state of play, to educate and inspire the enthusiasm of younger researchers, to attempt to solve some challenge problems and to make concrete plans for future research. The high quality of the talks, the generous allocation of time for collaboration, and the focused theme all featured as highlights in participants' evaluations. Several new research relationships involving younger researchers were developed.
Future plans included: extending the methods to groups defined over infinite fields, determining which algorithms are polynomial, extending available facilities and making them usable by nonspecialists and looking for new methods, such as computing symbolically rather than in specific groups. For several of these projects, specific work-plans were drawn up
Speakers
Peter Brooksbank, Bucknell University - Matrix Group Algorithms via Matrix Algebras
Damien Burns, University of Auckland - A Constructive Recognition Algorithm for Classical Groups
Dane Flannery, National University of Ireland - Deciding Finiteness of Matrix Groups
Herbert Fruchtl, EaStCHEM - The Computing Needs of EaStCHEM
Steve Glasby, Central Washington University - Random Remarks on Randomness
George Havas, University of Queensland - On Computing Efficient Presentations for Simple Groups
Gerhard Hiss, RWTH Aachen - Imprimitive Irreducible Representations of Finite Quasisimple Groups
Derek Holt, University of Warwick - Rearranging the Terms of a Composition Series
Alexander Hulpke, Colorado State University - Centralizers and Normalizers in the General Linear Group
Charles Leedham-Green, Queen Mary University - Seeking and Finding
Steve Linton, University of St Andrews - Welcome and Introduction to Computational Group Theory
Frank Lübeck, RWTH Aachen - Computing Defining Characteristic Representations
Kay Maagard, University of Birmingham - Constructive Recognition of Exceptional Groups of Lie Type
Scott Murray, University of Sydney - Computation with the Lie Correspondence
Alice Niemeyer, University of Western Australia - Estimating Proportions of Elements in Finite Classical Groups
Max Neunhoffer, University of St Andrews - The Current State of the Recog Package
Felix Noeske, RWTH Aachen - Matching Simple Modules of Condensed Algebras
Eamonn O'Brien, University of Auckland - A New Implementation of CompositionTree
Cheryl Praeger, University of Western Australia - Estimation Problems in Finite Classical Groups
Tobias Rossmann, National University of Ireland - Irreducibility and Primitivity Testing of Finite Nilpotent Matrix Groups Over Number Gields
Csaba Schneider, University of Lisbon - Constructive Membership Testing in Black-Box Groups
Akos Seress, Ohio State University - Polynomial-Time Theory of Matrix Groups
Bill Unger, University of Sydney - Matrix Groups in Magma
James Wilson, Ohio State University - Unique Decompositions of Large Unipotent Groups