Program

• Start: Monday 18^th March 2018 at 10:00
• Finish: Friday 22^nd March 2018 at 15:00

Organisational notepad for the GAP Days

Link to the HackMD for GAP Days Spring 2019. In this notepad, we invite you to share organisational information, and details about what you want to work on/have worked on during the GAP Days.

Detailed schedule

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 4:30pm, to communicate what we plan to work on, and what we have worked on, respectively. We will close the meeting at around 3pm on Friday.

• Monday (Room 5.09/5.10 in Von-Seckendorff-Platz 1)
  • 10:00: Opening of the GAP Days
  • 12:00 (ish): Lunch (in the Mensa)
  • 16:30: Stand-up meeting
  • 18:30: Workshop dinner at House of India
• Tuesday (Room 5.09/5.10 in Von-Seckendorff-Platz 1)
  • 09:15: Stand-up meeting
  • 10:00–10:30: Talk by Leonard Soicher:
       “Exploiting graph symmetry in the computation of chromatic number”
  • 11:55: Group photo
  • 12:00 (ish): Lunch (in the Mensa)
  • 16:30: Stand-up meeting
• Wednesday (Room 5.09/5.10 in Von-Seckendorff-Platz 1)
  • 09:15: Stand-up meeting
  • 10:00–10:30: Talk by Vincent Delecroix:
       “Galois group of polynomials”
  • 12:00 (ish): Lunch (in the Mensa)
  • 16:30: Stand-up meeting
• Thursday (Room 5.09/5.10 in Von-Seckendorff-Platz 1)
  • 09:15: Stand-up meeting
  • 10:00: Discussion about managing issues/PRs on gap-system/gap
  • 11:00: Discussion about GAP infrastructure for website & hosting
  • 12:00 (ish): Lunch (in the Mensa)
  • 14:00: Talk by Sergio Siccha (Room 1.02)
  • 15:00: Discussion led by Chris Jefferson about BacktrackKit
  • 16:30: Stand-up meeting
• Friday (Room 5.09/5.10 in Von-Seckendorff-Platz 1)
  • 09:15: Stand-up meeting
  • 10:00–10:30: Opportunity for spontaneous short talk(s)
  • 12:00 (ish): Lunch (in the Mensa)
  • 15:00: Close of the GAP Days

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