Abstract by Josh Linnell
Multilattice Simplex Covering Problem
Suppose we are given a lattice L, and a set of displacements D. Now let us take a simplex and a dilation of this simplex for each displacement. We would like to know when this creates a covering, as well as how much better we can do than the base tiling for a given lattice. We will explore the problem for a few small values of n.