Papers
Topics
Authors
Recent
Search
2000 character limit reached

Positroid cluster structures from relabeled plabic graphs

Published 18 Jun 2020 in math.CO, math.AG, and math.RA | (2006.10247v3)

Abstract: 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 graph $G$ for $P_v$ determines a cluster. We study the effect of relabeling the boundary vertices of $G$ by a permutation $r$. Under suitable hypotheses on the permutation, we show that the relabeled graph $Gr$ determines a cluster for a different open positroid variety $P_w$. As a key step of the proof, we show that $P_v$ and $P_w$ are isomorphic by a nontrivial twist isomorphism. Our constructions yield many cluster structures on each open positroid variety $P_w$, given by plabic graphs with appropriately relabeled boundary. We conjecture that the seeds in all of these cluster structures are related by a combination of mutations and Laurent monomial transformations involving frozen variables, and establish this conjecture for (open) Schubert and opposite Schubert varieties. As an application, we also show that for certain reduced plabic graphs $G$, the "source" cluster and the "target" cluster are related by mutation and Laurent monomial rescalings.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.