Minimal matchings from height functions
Authors
Published Date
Publisher
Abstract
We provide an explicit construction for minimal almost perfect matchings via height functions on plabic graphs corresponding to seeds of cluster algebras coming from the Grassmannian and lower-dimensional open positroid cells. In achieving such a construction, we have a road map for generating the set of all matchings with a fixed boundary condition and it is anticipated that this may lead to better understanding of higher dimer models and their corresponding poset structures.
Keywords
Description
University of Minnesota M.S. thesis. July 2025. Major: Mathematics. Advisor: Gregg Musiker. 1 computer file (PDF); vi, 65 pages.
Related to
item.page.replaces
License
Series/Report Number
Funding Information
item.page.isbn
DOI identifier
Previously Published Citation
Other identifiers
Suggested Citation
Anderson-Kroschel, Nickolas. (2025). Minimal matchings from height functions. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/277314.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.