
TL;DR
This paper establishes a connection between maximal collections of chord separated sets, plabic graphs, and zonotopal tilings, revealing their structural relationships and geometric interpretations.
Contribution
It introduces a new characterization of maximal chord separated sets as vertex labels of zonotopal tilings, linking combinatorics, geometry, and graph theory.
Findings
Maximal chord separated sets are also maximal by size.
Such collections correspond to vertex labels of fine zonotopal tilings.
Plabic graphs and square moves naturally arise in the tiling framework.
Abstract
We say that two sets are chord separated if there does not exist a cyclically ordered quadruple of integers satisfying and . This is a weaker version of Leclerc and Zelevinsky's weak separation. We show that every maximal by inclusion collection of pairwise chord separated sets is also maximal by size. Moreover, we prove that such collections are precisely vertex label collections of fine zonotopal tilings of the three-dimensional cyclic zonotope. In our construction, plabic graphs and square moves appear naturally as horizontal sections of zonotopal tilings and their mutations respectively.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
