{"id":{"repo_id":"mcmaster","oai_identifier":"oai:macsphere.mcmaster.ca:11375/33855"},"canonical_url":"https://search.ndltd.org/etd/mcmaster/oai:macsphere.mcmaster.ca:11375/33855","repository":{"repo_id":"mcmaster","name":"McMaster University","base_url":"https://macsphere.mcmaster.ca/server/oai/request"},"display":{"title":"Pointed Pairing Data in Rank 2 and Morphisms of Polyptych Lattices","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Naguit, Emma"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Mathematics","school":null,"contributors":[],"advisors":["Harada, Megumi"],"committee_chairs":[],"committee_members":[],"year":2026,"date_issued":"2026","date_published":"2026","updated_at":"2026-11-18T19:31:43Z","subjects":["Polyptych lattices","Pointed pairing data","Morphisms of polyptych lattices","Maps between polyptych lattices","Algebraic geometry","Combinatorics"],"languages":["en"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://doi.org/10.71548/25625"],"render_values":[{"text":"https://doi.org/10.71548/25625","href":"https://doi.org/10.71548/25625","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/11375/33855","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"https://hdl.handle.net/11375/33855","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%2F33855","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Harada, Megumi"]},{"key":"dc:contributor.department","label":"Department","values":["Mathematics"]},{"key":"dc:creator","label":"Author","values":["Naguit, Emma"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2026-10-15T12:38:31Z"]},{"key":"dc:date.issued","label":"Date","values":["2026"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Polyptych lattices","Pointed pairing data","Morphisms of polyptych lattices","Maps between polyptych lattices","Algebraic geometry","Combinatorics"]}]},{"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":["https://hdl.handle.net/11375/33855","https://doi.org/10.71548/25625"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Master of Science (MSc)"]},{"key":"dc:title","label":"Title","values":["Pointed Pairing Data in Rank 2 and Morphisms of Polyptych Lattices"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"dc:contributor.advisor":["Harada, Megumi"],"dc:contributor.department":["Mathematics"],"dc:creator":["Naguit, Emma"],"dc:date.accessioned":["2026-10-15T12:38:31Z"],"dc:date.issued":["2026"],"dc:description.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."],"dc:description.degree":["Master of Science (MSc)"],"dc:identifier.uri":["https://hdl.handle.net/11375/33855","https://doi.org/10.71548/25625"],"dc:language.iso":["en"],"dc:subject":["Polyptych lattices","Pointed pairing data","Morphisms of polyptych lattices","Maps between polyptych lattices","Algebraic geometry","Combinatorics"],"dc:title":["Pointed Pairing Data in Rank 2 and Morphisms of Polyptych Lattices"],"dc:type":["Thesis"],"others:access_status":["open.access"]},"updated_at":"2026-11-18T19:31:43Z"}