Links in the complex of weakly separated collections
Plabic graphs are combinatorial objects used to study the totally nonnegative Grassmannian. Faces of plabic graphs are labeled by k-element sets of positive integers, and a collection of such k-element sets are the face labels of a plabic graph if that collection forms a maximal weakly separated col...
Main Authors: | Suho Oh, David Speyer |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2020-04-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/6389/pdf |
Similar Items
-
The twist for positroids
by: Greg Muller, et al.
Published: (2020-04-01) -
Weak Separation, Pure Domains and Cluster Distance
by: Miriam Farber, et al.
Published: (2020-04-01) -
Extending the weak order on Coxeter groups
by: Francois Viard
Published: (2020-04-01) -
Separation of Variables and the Computation of Fourier Transforms on Finite Groups, II
by: David Maslan, et al.
Published: (2020-04-01) -
A two-sided analogue of the Coxeter complex
by: T. Kyle Petersen
Published: (2020-04-01)