Back to search
McMaster University
Computational determination of the largest lattice polytope diameter
Abstract
dc:description.abstractA lattice (d, k)-polytope is the convex hull of a set of points in dimension d whose coordinates are integers between 0 and k. Let δ(d, k) be the largest diameter over all lattice (d, k)-polytopes. We develop a computational framework to determine δ(d, k) for small instances. We show that δ(3, 4) = 7 and δ(3, 5) = 9; that is, we verify for (d, k) = (3, 4) and (3, 5) the conjecture whereby δ(d, k) is at most (k + 1)d/2 and is achieved, up to translation, by a Minkowski sum of lattice vectors.
Degree
thesis:*- Department dc:contributor.department
- Computing and Software
- Year dc:date.issued
- 2017
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Chadder, Nathan
- Advisor dc:contributor.advisor
-
- Deza, Antoine
Rights
- Language dc:language.iso
- en
Identifiers
dc:identifier.*- Identifier URI
- https://doi.org/10.71548/21393