Generalized Kasteleyn theorem for planar non-bipartite graphs in the disk

Let G\mathcal G be a graph in the broader class considered by the cited work, with edge set E\mathcal E, and let σ:E{±1}\sigma:\mathcal E\mapsto\{\pm1\} be a signature. For every finite face Ω\Omega, write

σ(Ω)=eΩσ(e)=(1)nw(Ω)+1,\sigma(\Omega)=\prod_{e\in\partial\Omega}\sigma(e)=(-1)^{n_w(\Omega)+1},

where nw(Ω)n_w(\Omega) is the number of internal white vertices bounding Ω\Omega. 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

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.