Please use this identifier to cite or link to this item:
http://hdl.handle.net/11375/22226
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Deza, Antoine | - |
dc.contributor.author | Chadder, Nathan | - |
dc.date.accessioned | 2017-10-17T12:43:44Z | - |
dc.date.available | 2017-10-17T12:43:44Z | - |
dc.date.issued | 2017 | - |
dc.identifier.uri | http://hdl.handle.net/11375/22226 | - |
dc.description.abstract | A 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. | en_US |
dc.language.iso | en | en_US |
dc.title | Computational determination of the largest lattice polytope diameter | en_US |
dc.type | Thesis | en_US |
dc.contributor.department | Computing and Software | en_US |
dc.description.degreetype | Thesis | en_US |
dc.description.degree | Master of Applied Science (MASc) | en_US |
Appears in Collections: | Open Access Dissertations and Theses |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Chadder_Nathan_S_2017Sept_MASc.pdf | 370.59 kB | Adobe PDF | View/Open |
Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.