-
Notifications
You must be signed in to change notification settings - Fork 1
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
3 changed files
with
32 additions
and
2 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
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. | ||
|
||
|
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
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. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters