Research-Data
Below you can find the research data belonging to the paper "Finiteness threshold width of lattice polytopes". The data was computed using polymake. The polytopes in the lists below are all in standard form as used in polymake and described in Normal forms of convex lattice polytopes.
The following lists consist of matrices containing the vertices of the polytopes as rows.
List of all hollow lattice 3-polytopes with width ≥ 2 that are contained in a maximal one and have
- 23 lattice points
- 22 lattice points
- 21 lattice points
- 20 lattice points
- 19 lattice points
- 18 lattice points
- 17 lattice points
- 16 lattice points
- 15 lattice points
- 14 lattice points
- 13 lattice points
- 12 lattice points
- 11 lattice points
- 10 lattice points
- 09 lattice points
- 08 lattice points
- 07 lattice points
- 06 lattice points
- 05 lattice points
- 04 lattice points
-
List of all maximal hollow lattice 3-polytopes with width ≥ 2 with
The maximal hollow lattice 3-polytopes were classified in
Notions of maximality for integral lattice-free polyhedra: the case of dimension three
-
Algorithms
- This file contains the algorithms used to compute the lists.
- several Algorithms