<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-21T03:59:42Z</responseDate><request verb="GetRecord" identifier="oai:macsphere.mcmaster.ca:11375/22226" metadataPrefix="dim">https://prod-ms-be.lib.mcmaster.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:macsphere.mcmaster.ca:11375/22226</identifier><datestamp>2026-09-24T00:18:13Z</datestamp><setSpec>com_11375_271</setSpec><setSpec>col_11375_272</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Deza, Antoine</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Chadder, Nathan</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department" lang="en_US">Computing and Software</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2017-10-17T12:43:44Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2017-10-17T12:43:44Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2017</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/11375/22226</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://doi.org/10.71548/21393</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">A lattice (d, k)-polytope is the convex hull of a set of points in dimension d whose&#xd;
coordinates are integers between 0 and k. Let δ(d, k) be the largest diameter over all&#xd;
lattice (d, k)-polytopes. We develop a computational framework to determine δ(d, k)&#xd;
for small instances. We show that δ(3, 4) = 7 and δ(3, 5) = 9; that is, we verify for&#xd;
(d, k) = (3, 4) and (3, 5) the conjecture whereby δ(d, k) is at most (k + 1)d/2 and is&#xd;
achieved, up to translation, by a Minkowski sum of lattice vectors.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreetype" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">Master of Applied Science (MASc)</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Computational determination of the largest lattice polytope diameter</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim></metadata></record></GetRecord></OAI-PMH>