Link to the HackMD for GAP Days Spring 2019

Topics and projects

The overarching theme of this GAP Days will be GAP’s infrastructure for computing with permutation groups, such as orbit and stabiliser algorithms, base and strong generating sets, partition backtrack for stabiliser, normaliser, and canonical images, chief series, Sylow subgroups, Schur multipliers and cohomology, and recognition methods for permutation groups. If you have any queries or suggestions, then please do not hesitate to contact the organisers.

  1. Overview of existing Permutation Group Code in GAP

  2. Partition backtrack methods in the GAP library

  3. Recognition methods for large base groups

Detailed schedule

The complete schedule will be announced closer to the event. We will open with a meeting at 10am on Monday to coordinate plans for the week, and follow a pattern of “Standups” each day at around 9am and 4pm, to communicate what we plan to work on, and what we have worked on, respectively. We expect to close the meeting at around 3pm on Friday. Please note that this schedule is currently incomplete, and may change significantly.