Related papers: A formula for Pl\"ucker coordinates associated wit…
Postnikov constructed a decomposition of a totally nonnegative Grassmannian into positroid cells. We provide combinatorial formulas that allow one to decide which cell a given point belongs to and to determine affine coordinates of the…
Franco, Galloni, Penante, and Wen have proposed a boundary measurement map for a graph on any closed orientable surface with boundary. We consider this boundary measurement map which takes as input an edge weighted directed graph embedded…
A plabic graph is a planar bicolored graph embedded in a disk, which satisfies some combinatorial conditions. Postnikov's boundary measurement map takes the space of positive edge weights of a plabic graph $G$ to a positroid cell in some…
The purpose of this note is to connect two maps related to certain graphs embedded in the disc. The first is Postnikov's boundary measurement map, which combines partition functions of matchings in the graph into a map from an algebraic…
The homogeneous coordinate ring of the Grassmannian Gr(k,n) has a cluster structure defined in terms of planar diagrams known as Postnikov diagrams. The cluster corresponding to such a diagram consists entirely of Pluecker coordinates. We…
We formulate a higher-rank version of the boundary measurement map for weighted planar bipartite networks in the disk. It sends a network to a linear combination of SL$_r$-webs, and is built upon the r-fold dimer model on the network. When…
Following [42], positroid cells ${\mathcal S}_{\mathcal M}^{\mbox{TNN}}$ in totally non-negative Grassmannians ${Gr^{\mbox{TNN}} (k,n)}$ admit parametrizations by positive weights on planar bicolored directed perfect networks in the disk.…
Amalgamation in the totally non-negative part of positroid varieties is equivalent to gluing copies of $Gr^{TP}(1,3)$ and $Gr^{TP}(2,3)$. Lam has proposed to represent amalgamation in positroid varieties by equivalence classes of relations…
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…
Deodhar introduced his decomposition of partial flag varieties as a tool for understanding Kazhdan-Lusztig polynomials. The Deodhar decomposition of the Grassmannian is also useful in the context of soliton solutions to the KP equation, as…
The aim of this paper is to discuss a relationship between total positivity and planar directed networks. We show that the inverse boundary problem for these networks is naturally linked with the study of the totally nonnegative…
The stratification of the Grassmannian by positroid varieties has been the subject of extensive research. Positroid varieties are in bijection with a number of combinatorial objects, including $k$-Bruhat intervals and bounded affine…
We investigate Poisson properties of Postnikov's map from the space of edge weights of a planar directed network into the Grassmannian. We show that this map is Poisson if the space of edge weights is equipped with a representative of a…
We propose an explicit construction of a weighted generalised Grassmannian. For a weighted Grassmannian (i.e., for series A) we obtain an effective parametrisation of possible $\mathbb{Z}$-gradings on Pl\"{u}cker coordinates, and provide…
Given a $d$-dimensional vector space $V \subset \mathbb{C}[u]$ of polynomials, its Wronskian is the polynomial $(u + z_1) \cdots (u + z_n)$ whose zeros $-z_i$ are the points of $\mathbb{C}$ such that $V$ contains a nonzero polynomial with a…
In this paper we construct an explicit map from planar bicolored (plabic) trivalent graphs representing a given irreducible positroid cell $S$ in the totally non-negative Grassmannian $Gr^{\mbox{TNN}}(k,n)$ to the spectral data for the…
Positroids are families of matroids introduced by Postnikov in the study of non-negative Grassmannians. In particular, positroids enumerate a CW decomposition of the totally non-negative Grassmannian. Furthermore, Postnikov has identified…
There is a cell decomposition of the nonnegative Grassmannian. For each cell, totally positive bases(TP-bases) is defined as the minimal set of Pl\"ucker variables such that all other nonzero Pl\"ucker variables in the cell can be expressed…
A connected matching in a graph G consists of a set of pairwise disjoint edges whose covered vertices induce a connected subgraph of G. While finding a connected matching of maximum cardinality is a well-solved problem, it is NP-hard to…
Postnikov's plabic graphs in a disk are used to parametrize totally positive Grassmannians. In recent years plabic graphs have found numerous applications in math and physics. One of the key features of the theory is the fact that if a…