McMaster University
Pointed Pairing Data in Rank 2 and Morphisms of Polyptych Lattices
Abstract
dc:description.abstractCombinatorics 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.
Degree
thesis:*- Department dc:contributor.department
- Mathematics
- Year dc:date.issued
- 2026
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Naguit, Emma
- Advisor dc:contributor.advisor
-
- Harada, Megumi
Subjects
dc:subject × 6Rights
- Language dc:language.iso
- en
Identifiers
dc:identifier.*- Identifier URI
- https://doi.org/10.71548/25625