Related papers: Links in the complex of weakly separated collectio…
Leclerc and Zelevinsky described quasicommuting families of quantum minors in terms of a certain combinatorial condition, called weak separation. They conjectured that all maximal by inclusion weakly separated collections of minors have the…
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 nonnegative Grassmannian is a cell complex with rich geometric, algebraic, and combinatorial structures. Its study involves interesting combinatorial objects, such as positroids and plabic graphs. Remarkably, the same combinatorial…
Plabic graphs are intimately connected to the positroid stratification of the positive Grassmannian. The duals to these graphs are quivers, and it is possible to associate to them cluster algebras. For the top-cell graph of $Gr_{+}(k,n)$,…
A collection $\mathcal{C}$ of $k$-element subsets of $\{1,2,\ldots,m\}$ is weakly separated if for each $I, J \in \mathcal{C}$, when the integers $1,2,\ldots,m$ are arranged around in a circle, there is a chord separating $I \backslash J$…
Weakly separated collections arise in the cluster algebra derived from the Pl\"ucker coordinates on the nonnegative Grassmannian. Oh, Postnikov, and Speyer studied weakly separated collections over a general Grassmann necklace $\mathcal{I}$…
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…
It is known that the homogeneous coordinate ring of a Grassmannian has a cluster structure, which is induced from the combinatorial structure of a plabic graph. A plabic graph is a certain bipartite graph described on the disk, and there is…
We introduce the totally nonnegative Lagrangian Grassmannian $\rm{LG}_{\geq 0}^R (n,2n)$, a new subset of the totally nonnegative Grassmannian consisting of subspaces isotropic with respect to a certain bilinear form $R$. We describe its…
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…
We give an explicit combinatorial description of cluster structures in Schubert varieties of the Grassmannian in terms of (target labelings of) Postnikov's plabic graphs. This description is a natural generalization of the description given…
In this article we introduce the notion of weak harmonic labeling of a graph, a generalization of the concept of harmonic labeling defined recently by Benjamini et al. that allows extension to finite graphs and graphs with leaves. We…
Planar bicolored (plabic) graphs are combinatorial objects introduced by Postnikov to give parameterizations of the positroid cells of the totally nonnegative Grassmannian $\text{Gr}^{\geq 0}(n,k)$. Any two plabic graphs for the same…
The Grassmannian is a disjoint union of open positroid varieties $P_v$, certain smooth irreducible subvarieties whose definition is motivated by total positivity. The coordinate ring of $P_v$ is a cluster algebra, and each reduced plabic…
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…
Clustering a signed graph means partitioning the vertices into sets ("clusters") so that every positive edge, and no negative edge, is within a cluster. Clustering is not always possible; the obstruction is circles with exactly one negative…
Algebra bundles, in the strict sense, appear in many areas of geometry and physics. However, the structure of an algebra is flexible enough to vary non-trivially over a connected base, giving rise to a structure of a weak algebra bundle. We…
There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable minor-closed class, such as the class of all planar graphs. Here we use combinatorial and probabilistic methods to investigate a…
A digraph $\mathbb G$ is called weakly connected, strongly connected, and extremely connected if any two vertices of $\mathbb G$ are connected respectively by an oriented, a directed, and a symmetric path in $\mathbb G$. We investigate the…
In this article we explain how the coordinate ring of each (open) Schubert variety in the Grassmannian can be identified with a cluster algebra, whose combinatorial structure is encoded using (target labelings of) Postnikov's plabic graphs.…