Abstract

Maximal minors of Kasteleyn sign matrices on planar bipartite graphs in the disk count dimer configurations with prescribed boundary conditions, and the weighted version of such matrices provides a natural parametrization of the totally non–negative part of real Grassmannians (Postnikov et al. J. Algebr. Combin. 30(2), 173–191, 2009; Lam J. Lond. Math. Soc. (2) 92(3), 633–656, 2015; Lam 2016; Speyer 2016; Affolter et al. 2019). In this paper we provide a geometric interpretation of such variant of Kasteleyn theorem: a signature is Kasteleyn if and only if it is geometric in the sense of Abenda and Grinevich (2019). We apply this geometric characterization to explicitly solve the associated system of relations and provide a new proof that the parametrization of positroid cells induced by Kasteleyn weighted matrices coincides with that of Postnikov boundary measurement map. Finally we use Kasteleyn system of relations to associate algebraic geometric data to KP multi-soliton solutions. Indeed the KP wave function solves such system of relations at the nodes of the spectral curve if the dual graph of the latter represents the soliton data. Therefore the construction of the divisor is automatically invariant, and finally it coincides with that in Abenda and Grinevich (Sel. Math. New Ser. 25(3), 43, 2019; Abenda and Grinevich 2020) for the present class of graphs.

Highlights

  • Kasteleyn [32] and Temperley–Fisher [62] started the study of the dimer model by computing the number of dimer configurations on a rectangular grid

  • More recently dimer models on planar bipartite periodic graphs have appeared in mathematical literature because of their relation to combinatorics, algebraic geometry and quantum integrable systems [16, 17, 22, 29, 35, 36]

  • In [55] it was pointed out the existence of a bijection between almost perfect matchings and perfect orientations of G, and toric geometry was used to investigate the topology of totally non–negative Grassmannians

Read more

Summary

Introduction

Kasteleyn [32] and Temperley–Fisher [62] started the study of the dimer model by computing the number of dimer configurations on a rectangular grid. The variant of Kasteleyn theorem relevant in such setting is the following one [59]: for a planar bipartite graph in the disk with boundary vertices of the same color, there exists a sign matrix such that its maximal minors give the number of almost perfect matchings with prescribed boundary conditions. If one fixes a Kasteleyn signature as in (1.1) and assigns positive edge weights to the graph, the maximal minors of the weighted Kasteleyn matrix Kσ,wt defined in (3.7) are the Plucker coordinates of the point in the totally non–negative Grassmannian given by the boundary measurement map introduced in [54].

35 Page 8 of 64
35 Page 10 of 64
35 Page 12 of 64
Kasteleyn Matrices on Planar Bipartite Networks in the Disk
35 Page 16 of 64
35 Page 18 of 64
35 Page 24 of 64
Kasteleyn Systems of Relations
35 Page 26 of 64
35 Page 28 of 64
Weak Kasteleyn Signatures and Duality Relations in Positroid Varieties
35 Page 30 of 64
35 Page 32 of 64
35 Page 34 of 64
Lam Representation of Systems of Relations
35 Page 36 of 64
The Geometric Nature of Kasteleyn Signatures
35 Page 38 of 64
35 Page 40 of 64
35 Page 42 of 64
35 Page 44 of 64
Geometric Signatures are Kasteleyn
35 Page 48 of 64
Construction of Real Regular KP Divisors Using Kasteleyn System of Relations
35 Page 52 of 64
35 Page 54 of 64
35 Page 60 of 64
35 Page 62 of 64
35 Page 64 of 64

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.