Skip to content

Commit

Permalink
added abstracts
Browse files Browse the repository at this point in the history
  • Loading branch information
Munsee committed Aug 22, 2024
1 parent 875253e commit 66530ec
Show file tree
Hide file tree
Showing 3 changed files with 32 additions and 2 deletions.
14 changes: 14 additions & 0 deletions abstracts/schnelle.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,14 @@
---
layout: default
permalink: /abstracts/linton
---

## Lukas Schnelle

### Usage of GAP in Topological Interlocking Research

This is joint work with Alice C. Niemeyer and Reymond Akpanya

In 1911 Bieberbach solved the 18. of Hilberts 23 problems, by showing that there are only finitely many crystallographic groups of a given dimension. The definition of a crystallographic group of dimension $n$ requires the existence of a fundamental domain, a certain subset of $\R^n$, which there are many of for any given group. However computing any one of them is quite difficult, as crystallographic groups are of infinite order. In this talk, an algorithm is presented that uses Dirichlet cells, a concept closely related to Voronoi domains. The algorithm assumes some knowledge of the crystallographic group, which for all groups of small dimension (up to 6) is already known.


16 changes: 16 additions & 0 deletions abstracts/soicher.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,16 @@
---
layout: default
permalink: /abstracts/linton
---

## Leonard Soicher

### The effective use of the GRAPE package for computing with graphs and groups

The GRAPE package for GAP provides functionality for computing with
graphs together with associated groups of automorphisms, and is designed
primarily for applications in algebraic graph theory, permutation group
theory, design theory, and finite geometry. GRAPE has been developed and
been part of the GAP distribution for over thirty years now, and in this
talk I will present some of the philosophy of GRAPE and pointers on how
to make the most effective use of GRAPE in your research.
4 changes: 2 additions & 2 deletions program.md
Original file line number Diff line number Diff line change
Expand Up @@ -36,15 +36,15 @@ This schedule is subject to change.
- 9:00 **Digraphs Half-day**
- 12:30 *Lunch break*
- 13:30 Work session
- 15:00 Talk: *"The effective use of the GRAPE package for computing with graphs and groups"* (Leonard Soicher)
- 15:00 Talk: *"The effective use of the GRAPE package for computing with graphs and groups"* (Leonard Soicher) ([abstract]({{ site.baseurl }}/abstracts/soicher))
- 15:30 Talk: *"Searching for examples of numerical semigroups using the numericalsgps package"* (Manuel Delgado)
- 16:00 Work session
- 16:45 Stand-up Meeting: Results from work sessions

- **Thursday**
- 9:00 Stand-up Meeting: Plans for the day
- 9:15 Work session
- 10:30 Talk: *"Usage of GAP in Topological Interlocking Research"* (Lukas Schnelle)
- 10:30 Talk: *"Usage of GAP in Topological Interlocking Research"* (Lukas Schnelle) ([abstract]({{ site.baseurl }}/abstracts/schnelle))
- 11:00 Work session
- 12:30 *Lunch break*
- 13:30 Work session
Expand Down

0 comments on commit 66530ec

Please sign in to comment.