<?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:27:52Z</responseDate><request verb="GetRecord" identifier="oai:macsphere.mcmaster.ca:11375/33855" metadataPrefix="dim">https://prod-ms-be.lib.mcmaster.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:macsphere.mcmaster.ca:11375/33855</identifier><datestamp>2026-10-16T07:07:50Z</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">Harada, Megumi</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Naguit, Emma</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Mathematics</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2026-10-15T12:38:31Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2026</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/11375/33855</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://doi.org/10.71548/25625</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract">Combinatorics is an area of mathematics involving both counting problems and discrete objects. Algebraic geometry studies the solution sets of polynomials, called varieties. The theory of toric geometry offers a dictionary between these areas of math. In 2024, Escobar, Harada and Manon introduced a combinatorial object called a polyptych lattice and accompanying theory which aims to generalize this dictionary. Recent developments in this theory include a method of storing the data of related polyptych lattices as a triple of data called pointed pairing data, as well as notions of maps between polyptych lattices. The main goal of this thesis is to further develop this theory. For instance, we provide a new family of examples of rank 2 pointed pairing data. Furthermore, we explicitly compute the set of all maps of a specific type between two specific polyptych lattices. Finally, we prove some general results about maps between polyptych lattices.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreetype">Thesis</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree">Master of Science (MSc)</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en</dim:field>
   <dim:field mdschema="dc" element="subject">Polyptych lattices</dim:field>
   <dim:field mdschema="dc" element="subject">Pointed pairing data</dim:field>
   <dim:field mdschema="dc" element="subject">Morphisms of polyptych lattices</dim:field>
   <dim:field mdschema="dc" element="subject">Maps between polyptych lattices</dim:field>
   <dim:field mdschema="dc" element="subject">Algebraic geometry</dim:field>
   <dim:field mdschema="dc" element="subject">Combinatorics</dim:field>
   <dim:field mdschema="dc" element="title">Pointed Pairing Data in Rank 2 and Morphisms of Polyptych Lattices</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Thesis</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim></metadata></record></GetRecord></OAI-PMH>