Achill Schuermann
In this paper, we classify the perfect lattices in dimension 8. There are 10916 of them. Our classification heavily relies on exploiting symmetry in polyhedral computations. Here we describe algorithms making the classification possible.
In this paper we use topological tools to investigate the structure of the algebraic K-groups K_4 (Z[i]) and K_4 (Z[rho]), where i := sqrt{-1} and rho := (1+sqrt{-3})/2. We exploit the close connection between homology groups of GL_n(R) for…
G.F. Voronoi (1868-1908) wrote two memoirs in which he describes two reduction theories for lattices, well-suited for sphere packing and covering problems. In his first memoir a characterization of locally most economic packings is given,…
Let Gamma be the group GL_N (OO_D), where OO_D is the ring of integers in the imaginary quadratic field with discriminant D<0. In this paper we investigate the cohomology of Gamma for N=3,4 and for a selection of discriminants: D >= -24…
A configuration of particles confined to a sphere is balanced if it is in equilibrium under all force laws (that act between pairs of points with strength given by a fixed function of distance). It is straightforward to show that every…
We give a short survey on computational techniques which can be used to solve the representation conversion problem for polyhedra up to symmetries. We in particular discuss decomposition methods, which reduce the problem to a number of…
In this paper we report on massive computer experiments aimed at finding spherical point configurations that minimize potential energy. We present experimental evidence for two new universal optima (consisting of 40 points in 10 dimensions…
We investigate the Ehrhart polynomial for the class of 0-symmetric convex lattice polytopes in Euclidean $n$-space $\mathbb{R}^n$. It turns out that the roots of the Ehrhart polynomial and Minkowski's successive minima are closely related…
In an Euclidean $d$-space, the container problem asks to pack $n$ equally sized spheres into a minimal dilate of a fixed container. If the container is a smooth convex body and $d\geq 2$ we show that solutions to the container problem can…
We determine the integral homology of PSL4(Z) in degrees at most 5 and determine its p-part in higher degrees for the primes p>=5. Our method applies to other arithmetic groups; as illustrations we include descriptions of the integral…
We study dimensional trends in ground states for soft-matter systems. Specifically, using a high-dimensional version of Parrinello-Rahman dynamics, we investigate the behavior of the Gaussian core model in up to eight dimensions. The…
A positive definite quadratic form is called perfect, if it is uniquely determined by its arithmetical minimum and the integral vectors attaining it. In this self-contained survey we explain how to enumerate perfect forms in $d$ variables…
The contact polytope of a lattice is the convex hull of its shortest vectors. In this paper we classify the facets of the contact polytope of the Leech lattice up to symmetry. There are 1,197,362,269,604,214,277,200 many facets in 232…
We show that the Leech lattice gives a sphere covering which is locally least dense among lattice coverings. We show that a similar result is false for the root lattice E8. For this we construct a less dense covering lattice whose Delone…
In this paper we are concerned with finding the vertices of the Voronoi cell of a Euclidean lattice. Given a basis of a lattice, we prove that computing the number of vertices is a #P-hard problem. On the other hand we describe an algorithm…
In this paper we are concerned with three lattice problems: the lattice packing problem, the lattice covering problem and the lattice packing-covering problem. One way to find optimal lattices for these problems is to enumerate all finitely…
We consider Voronoi's reduction theory of positive definite quadratic forms which is based on Delone subdivision. We extend it to forms and Delone subdivisions having a prescribed symmetry group. Even more general, the theory is developed…
We characterize the three-dimensional spaces admitting at least six or at least seven equidistant points. In particular, we show the existence of $C^\infty$ norms on $\R^3$ admitting six equidistant points, which refutes a conjecture of…
We describe algorithms which address two classical problems in lattice geometry: the lattice covering and the simultaneous lattice packing-covering problem. Theoretically our algorithms solve the two problems in any fixed dimension d in the…