dc.contributor.advisor |
Young, Benjamin |
|
dc.contributor.author |
Jenne, Helen |
|
dc.date.accessioned |
2020-09-24T17:20:47Z |
|
dc.date.available |
2020-09-24T17:20:47Z |
|
dc.date.issued |
2020-09-24 |
|
dc.identifier.uri |
https://scholarsbank.uoregon.edu/xmlui/handle/1794/25669 |
|
dc.description.abstract |
We prove that the partition function for tripartite double-dimer configurations of a planar bipartite graph satisfies a recurrence related to the Desnanot-Jacobi identity from linear algebra. A similar identity for the dimer partition function was established nearly 20 years ago by Kuo. This work was motivated in part by the potential for applications, including a problem in Donaldson-Thomas and Pandharipande-Thomas theory, which we will discuss. The proof of our recurrence requires generalizing work of Kenyon and Wilson; specifically, lifting their assumption that the nodes of the graph be black and odd or white and even. |
en_US |
dc.language.iso |
en_US |
|
dc.publisher |
University of Oregon |
|
dc.rights |
All Rights Reserved. |
|
dc.subject |
dimer model |
en_US |
dc.subject |
double-dimer model |
en_US |
dc.title |
Combinatorics of the Double-Dimer Model |
|
dc.type |
Electronic Thesis or Dissertation |
|
thesis.degree.name |
Ph.D. |
|
thesis.degree.level |
doctoral |
|
thesis.degree.discipline |
Department of Mathematics |
|
thesis.degree.grantor |
University of Oregon |
|