Geometric nature of relations on plabic graphs and totally non-negative Grassmannians
Simonetta Abenda, Petr G. Grinevich

TL;DR
This paper characterizes geometric signatures on plabic graphs that parametrize totally non-negative Grassmannians, establishing their uniqueness, combinatorial properties, and connections to boundary measurement maps and network transformations.
Contribution
It provides an explicit construction and characterization of signatures satisfying total non-negativity, linking geometric indices to combinatorial face properties and extending boundary measurement formulas.
Findings
Unique geometric signatures determined by winding and intersection numbers.
Signatures depend only on white vertices in faces, resembling Kasteleyn properties.
Explicit formulas for signature transformations under network moves.
Abstract
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 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.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Markov Chains and Monte Carlo Methods · Random Matrices and Applications
