Generalized Kasteleyn theorem for planar non-bipartite graphs in the disk
Generalized Kasteleyn theorem for planar non-bipartite graphs in the disk
Let be a graph in the broader class considered by the cited work, with edge set , and let be a signature. For every finite face , write
where is the number of internal white vertices bounding . Generalized Kasteleyn theorem conjecture. A signature satisfying this face condition realizes the variant of Kasteleyn's theorem for planar non-bipartite graphs in the disk: Pfaffians of minors of the sign matrix count dimer configurations involving every internal vertex exactly once, with prescribed boundary conditions. The usual bipartite correspondence is established earlier in the source, whereas this non-bipartite extension is presented as conjectural and is deferred to future work.
Sources & referencesView supporting material
Primary source
Simonetta Abenda, “Kasteleyn theorem, geometric signatures and KP-II divisors on planar bipartite networks in the disk”, arXiv:2012.13797 (2021).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.