Papers
Topics
Authors
Recent
Search
2000 character limit reached

Dimer face polynomials in knot theory and cluster algebras

Published 20 Aug 2024 in math.CO and math.GT | (2408.11156v2)

Abstract: The set of perfect matchings of a connected bipartite plane graph $G$ has the structure of a distributive lattice, as shown by Propp, where the partial order is induced by the height of a matching. In this article, our focus is the dimer face polynomial of $G$, which is the height generating function of all perfect matchings of $G$. We connect the dimer face polynomial on the one hand to knot theory, and on the other to cluster algebras. We show that certain dimer face polynomials are multivariate generalizations of Alexander polynomials of links, highlighting another combinatorial view of the Alexander polynomial. We also show that an arbitrary dimer face polynomial is an $F$-polynomial in the cluster algebra whose initial quiver is dual to the graph $G$. As a result, we recover a recent representation theoretic result of Bazier-Matte and Schiffler that connects $F$-polynomials and Alexander polynomials, albeit from a very different, dimer-based perspective. As another application of our results, we also show that all nonvanishing Pl\"ucker coordinates on open positroid varieties are cluster monomials.

Citations (2)

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.