1 citations · 2 across the 8 of their papers we have counts for
8 papers
Local Statistics of the -Dimer Model
Nickolas Anderson, Moriah Elkin, Elizabeth Kelley +2
The classical dimer model is concerned with the (weighted) enumeration of perfect matchings of a graph. An -dimer cover is a multiset of edges that can be realized as the disjoi…
Matrix Formulae and Skein Relations for Quasi-Cluster Algebras
Cody Gilbert, McCleary Philbin, Kayla Wright
In this paper, we give matrix formulae for non-orientable surfaces that provide the Laurent expansion for quasi-cluster variables, generalizing the orientable surface matrix formul…
Twists of Gr(3,n) Cluster Variables as Double and Triple Dimer Partition Functions
Moriah Elkin, Gregg Musiker, Kayla Wright
We give a combinatorial interpretation for certain cluster variables in Grassmannian cluster algebras in terms of double and triple dimer configurations. More specifically, we exam…
Mixed Dimer Configuration Model in Type Cluster Algebras II: Beyond the Acyclic Case
Libby Farrell, Gregg Musiker, Kayla Wright
This is a sequel to the second and third author's Mixed Dimer Configuration Model in Type Cluster Algebras where we extend our model to work for quivers that contain oriented c…
Marked non-orientable surfaces and cluster categories via symmetric representations
Véronique Bazier-Matte, Aaron Chan, Kayla Wright
We initiate the investigation of representation theory of non-orientable surfaces. As a first step towards finding an additive categorification of Dupont and Palesi's quasi-cluster…
Quivers from non-orientable surfaces
Véronique Bazier-Matte, Fenghuan He, Ruiyan Huang +2
We associate a quiver to a quasi-triangulation of a non-orientable marked surface and define a notion of quiver mutation that is compatible with quasi-cluster algebra mutation defi…
Mixed Dimer Configuration Model in Type D Cluster Algebras
Gregg Musiker, Kayla Wright
We give a combinatorial model for F-polynomials and g-vectors for type D cluster algebras where the associated quiver is acyclic. Our model utilizes a combination of dimer configur…
Triangulating Almost-Complete Graphs
Kim Nguyen Pham, Landon Settle, Kayla Wright +1
A triangle decomposition of a graph is a partition of the edges of into triangles. Two necessary conditions for to admit such a decomposition are that is a mul…