Geometric nature of relations on plabic graphs and totally non-negative Grassmannians

Autor: Abenda, Simonetta, Grinevich, Petr G.
Rok vydání: 2021
Předmět:
Druh dokumentu: Working Paper
Popis: The standard parametrization of totally non-negative Grassmannians was obtained by A. Postnikov [45] introducing the boundary measurement map in terms of discrete path integration on planar bicolored (plabic) graphs in the disk. An alternative parametrization was proposed by T. Lam [38] introducing systems of relations on vectors on such graphs, depending on some signatures defined on edges. The problem of characterizing the signatures corresponding to the totally non-negative cells, was left open in [38]. In our paper we provide an explicit construction of such signatures, satisfying both the full rank condition and the total non-negativity property on the full positroid cell. If the graph $\mathcal G$ satisfies the following natural constraint: each edge belongs to some oriented path from the boundary to the boundary, then such signature is unique up to a vertex gauge transformation. Such signature is uniquely identified by geometric indices (local winding and intersection number) ruled by the orientation $\mathcal O$ and gauge ray direction $\mathfrak l$ on $\mathcal G$. Moreover, we provide a combinatorial representation of geometric signatures by showing that the total signature of every finite face just depends on the number of white vertices on it. The latter characterization is a Kasteleyn-type property [7,1] and we conjecture a mechanical-statistical interpretation of such relations. An explicit connection between the solution of Lam system of relations and the value of Postnikov boundary measurement map is established using the generalization of Talaska formula [50] obtained in [6]. In particular, the components of the edge vectors are rational in the edge weights with subtraction-free denominators. Finally, we provide explicit formulas for transformations of signatures under Postnikov moves and reductions, and amalgamations of networks.
Comment: 39 pages, several figures. We have split preprint arXiv:1908.07437 into two parts. This is the fully revised second part. arXiv admin note: text overlap with arXiv:2108.03229; V2: 45 pages. Added figures and examples, corrected typos
Databáze: arXiv