Computational and algorithmic methods

Workshop theme

This workshop has three principal components. The first is to identify big challenges in computational representation theory, with a particular focus on how computational techniques can assist in their solution. Examples include classification of maximal subgroups of finite simple groups, and the various conjectures on p-local subgroups. A second is to report on the status of the Matrix Group Recognition Project: what are the major open problems? How can the existing machinery be best used? A third is to prompt the development of techniques to work with linear groups defined over infinite domains. Machinery in this area remains very limited.

We expect that the lectures will cover all three components, and will be in part instructional for the benefit of those researchers who do not currently use computational tools in their research.

Applications for this workshop are now closed

The Institute kindly requests that any papers published as a result of this programme’s activities are credited as such. Please acknowledge the support of the Institute in your paper using the following text:

The author(s) would like to thank the Isaac Newton Institute for Mathematical Sciences, Cambridge, for support and hospitality during the programme Computational and algorithmic methods, where work on this paper was undertaken. This work was supported by EPSRC grant EP/R014604/1.

Timetable

Monday 27th January 2020
09:30 to 10:00	Registration	No Room Required
10:00 to 10:10	Welcome from Christie Marr (INI Deputy Director)	No Room Required
10:10 to 11:00	Meinolf Geck Universität Stuttgart Computing Green functions in small characteristics	Room 1
11:00 to 11:30	Morning Coffee	No Room Required
11:30 to 12:20	David Craven University of Birmingham Constructing subgroups of exceptional algebraic groups	Room 1
12:20 to 13:45	Lunch at Westminster College	No Room Required
13:45 to 14:35	Heiko Dietrich Monash University Constructive recognition of matrix groups	Room 1
14:45 to 15:35	Joanna Fawcett Imperial College London Base sizes of permutation groups	Room 1
15:35 to 16:05	Afternoon Tea	No Room Required
16:05 to 16:35	Melissa Lee Imperial College London Base sizes of permutation groups: an encore	Room 1
16:40 to 17:30	Thomas Breuer RWTH Aachen University Connections between Group related Databases in GAP	Room 1
17:30 to 18:30	Welcome Wine Reception at INI	No Room Required

Tuesday 28th January 2020
09:10 to 10:00	Nicolas Thiery Musing on implementing semigroup representation theory and software integration	Room 1
10:10 to 11:00	Frank Lübeck RWTH Aachen University Computing Brauer character tables of groups of Lie type in defining characteristic	Room 1
11:00 to 11:30	Morning Coffee	No Room Required
11:30 to 12:20	Madeleine Whybrow An algorithm to construct dihedral axial algebras	Room 1
12:20 to 13:45	Lunch at Westminster College	No Room Required
13:45 to 14:35	Klaus Lux University of Arizona The 5-modular Character Table of the Lyons Group	Room 1
14:45 to 15:35	David Stewart University of Newcastle upon Tyne Between the sheets: rigid nilpotent elements in modular Lie algebras	Room 1
15:35 to 16:05	Afternoon Tea	No Room Required
16:05 to 16:55	Richard Parker None / Other 10 years of meataxe development.	Room 1

Wednesday 29th January 2020
09:10 to 10:00	Adam Thomas University of Warwick Computational methods for exceptional groups	Room 1
10:10 to 11:00	Allan Steel University of Sydney Constructing Ordinary Representations of Finite Groups via Extension	Room 1
11:00 to 11:30	Morning Coffee	No Room Required
11:30 to 12:20	Willem de Graaf University of Trento Real forms of complex embeddings of maximal reductive Lie algebras in semisimple Lie algebras	Room 1
12:30 to 13:30	Lunch at Westminster College	No Room Required
13:45 to 17:00	Free afternoon	No Room Required

Thursday 30th January 2020
09:10 to 10:00	Mohamed Barakat Universität Siegen Chevalley’s Theorem on constructible images made constructive	Room 1
10:10 to 11:00	Alexander Hulpke Colorado State University Towards a nonsolvable Quotient Algorithm	Room 1
11:00 to 11:30	Morning Coffee	No Room Required
11:30 to 12:20	Bettina Eick Technische Universität Braunschweig Conjugacy problems in GL(n,Z)	Room 1
12:20 to 13:45	Lunch at Westminster College	No Room Required
13:45 to 14:35	Ulrich Thiel University of Kaiserslautern Minimal models of symplectic quotient singularities	Room 1
14:45 to 15:35	Dane Flannery National University of Ireland Galway Classifying finite linear groups in prime degree	Room 1
15:35 to 16:05	Afternoon Tea	No Room Required
16:05 to 16:35	Eilidh McKemmie University of Southern California Invariable generation of finite classical groups	Room 1
16:35 to 17:05	Mun See Chang University of St Andrews Computing normalisers of highly intransitive permutation groups	Room 1
19:30 to 22:00	Formal Dinner at Corpus Christi (Hall)	No Room Required

Friday 31st January 2020
09:10 to 10:00	Tobias Rossmann National University of Ireland Galway Growth of class numbers of unipotent groups	Room 1
10:10 to 11:00	Jay Taylor University of Southern California Classifying Isomorphism Classes of Algebraic Groups	Room 1
11:00 to 11:30	Morning Coffee	No Room Required
11:30 to 12:20	Christopher Jefferson University of St Andrews Backtrack Search in Permutation Groups	Room 1
12:30 to 13:30	Lunch at Westminster College	No Room Required
13:45 to 14:35	Cheryl Praeger University of Western Australia Classical groups, and generating small classical subgroups	Room 1
14:45 to 15:35	Martin Liebeck Imperial College London Computing with conjugacy classes in classical groups	Room 1