Combinatorics of symmetric plabic graphs

From MaRDI portal
Publication:680581

DOI10.4310/JOC.2018.V9.N2.A3zbMATH Open1378.05033arXiv1510.02122MaRDI QIDQ680581FDOQ680581

Rachel Karpman, Yi Su

Publication date: 23 January 2018

Published in: Journal of Combinatorics (Search for Journal in Brave)

Abstract: 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 totally nonnegative Grassmannian. In this note, we investigate plabic graphs which are symmetric about a line of reflection, up to reversing the colors of vertices. These symmetric plabic graphs arise naturally in the study of total positivity for the Lagrangian Grassmannian. We characterize various combinatorial objects associated with symmetric plabic graphs, and describe the subset of a Grassmannian which can be realized by symmetric weightings of symmetric plabic graphs.


Full work available at URL: https://arxiv.org/abs/1510.02122




Recommendations





Cited In (9)





This page was built for publication: Combinatorics of symmetric plabic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q680581)