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 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.
Recommendations
- Symmetries on plabic graphs and associated polytopes
- scientific article; zbMATH DE number 1285774
- Combinatorial invariants on planar graphs
- scientific article; zbMATH DE number 6004895
- Symmetries of finite graphs and homology
- Symmetric graphs from polytopes of high rank
- The characteristic polynomials of symmetric graphs
- On a class of finite symmetric graphs
- The Plancherel measure for symmetric graphs
- On chromatic symmetric homology and planarity of graphs
Cited in
(17)- Total positivity for the Lagrangian Grassmannian
- Higher secondary polytopes and regular plabic graphs
- D3-brane loop amplitudes from M5-brane tree amplitudes
- Cyclic sieving for plane partitions and symmetry
- The purity conjecture in type \(C\)
- Unified formalism for 6D superamplitudes based on a symplectic Grassmannian
- Flip cycles in plabic graphs
- Plabic \(R\)-matrices
- Links in the complex of weakly separated collections
- On Plücker coordinates of a perfectly oriented planar network
- Total positivity for the Lagrangian Grassmannian
- Links in the complex of weakly separated collections (Extended abstract)
- Triangular-grid billiards and plabic graphs
- Geometric Nature of Relations on Plabic Graphs and Totally Non-negative Grassmannians
- Higher Bruhat orders of types B and C
- Planar networks and simple Lie groups beyond type A
- Modern theory of electrical networks: from the matrix-tree theorem to the theory of cluster varieties
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)