Some six-dimensional rigid forms
classification
🧮 math.MG
math.CO
keywords
rigidlatticesformsdirichlet-voronoifoundpolytopespositivequadratic
read the original abstract
One can always decompose Dirichlet-Voronoi polytopes of lattices non-trivially into a Minkowski sum of Dirichlet-Voronoi polytopes of rigid lattices. In this report we show how one can enumerate all rigid positive semidefinite quadratic forms (and thereby rigid lattices) of a given dimension d. By this method we found all rigid positive semidefinite quadratic forms for d = 5 confirming the list of 7 rigid lattices by Baranovskii and Grishukhin. Furthermore, we found out that for d <= 5 the adjacency graph of primitive L-type domains is an infinite tree on which GL_d(Z) acts. On the other hand, we demonstrate that in d = 6 we face a combinatorial explosion.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.