{"id":{"repo_id":"mcmaster","oai_identifier":"oai:macsphere.mcmaster.ca:11375/22226"},"canonical_url":"https://search.ndltd.org/etd/mcmaster/oai:macsphere.mcmaster.ca:11375/22226","repository":{"repo_id":"mcmaster","name":"McMaster University","base_url":"https://macsphere.mcmaster.ca/server/oai/request"},"display":{"title":"Computational determination of the largest lattice polytope diameter","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Chadder, Nathan"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Computing and Software","school":null,"contributors":[],"advisors":["Deza, Antoine"],"committee_chairs":[],"committee_members":[],"year":2017,"date_issued":"2017","date_published":"2017","updated_at":"2026-11-18T19:38:35Z","subjects":[],"languages":["en"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://doi.org/10.71548/21393"],"render_values":[{"text":"https://doi.org/10.71548/21393","href":"https://doi.org/10.71548/21393","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/11375/22226","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"http://hdl.handle.net/11375/22226","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://macsphere.mcmaster.ca/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Amacsphere.mcmaster.ca%3A11375%2F22226","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Deza, Antoine"]},{"key":"dc:contributor.department","label":"Department","values":["Computing and Software"]},{"key":"dc:creator","label":"Author","values":["Chadder, Nathan"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2017-10-17T12:43:44Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2017-10-17T12:43:44Z"]},{"key":"dc:date.issued","label":"Date","values":["2017"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/11375/22226","https://doi.org/10.71548/21393"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Master of Applied Science (MASc)"]},{"key":"dc:title","label":"Title","values":["Computational determination of the largest lattice polytope diameter"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"dc:contributor.advisor":["Deza, Antoine"],"dc:contributor.department":["Computing and Software"],"dc:creator":["Chadder, Nathan"],"dc:date.accessioned":["2017-10-17T12:43:44Z"],"dc:date.available":["2017-10-17T12:43:44Z"],"dc:date.issued":["2017"],"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."],"dc:description.degree":["Master of Applied Science (MASc)"],"dc:identifier.uri":["http://hdl.handle.net/11375/22226","https://doi.org/10.71548/21393"],"dc:language.iso":["en"],"dc:title":["Computational determination of the largest lattice polytope diameter"],"dc:type":["Thesis"],"others:access_status":["open.access"]},"updated_at":"2026-11-18T19:38:35Z"}