Finest positroid subdivisions from maximal weakly separated collections
Gleb A. Koshevoy, Fang Li, Lujun Zhang

TL;DR
This paper characterizes when maximal weakly separated collections induce the finest positroid subdivisions of hypersimplices in the positive tropical Grassmannian, revealing their structure and boundary properties.
Contribution
It provides a necessary and sufficient condition for maximal weakly separated collections to form positroid subdivisions, and shows these subdivisions are the finest, answering a key question in the field.
Findings
Characterization of when collections induce positroid subdivisions
All such subdivisions are the finest possible
Boundary preservation of maximal weakly separated collections
Abstract
We adopt a formal and algebraic approach of Early \cite{E2} to study the positive tropical Grassmannian . Specifically, we deal with positroid subdivision of hypersimplex induced by translated blades from any maximal weakly separated collection. One of our main results gives a necessary and sufficient condition on a maximal weakly separated collection to form a positroid subdivision of a hypersimplex corresponding to a simplicial cone in . For k = 2 our condition says that any weakly separated collection of two-elements sets gives such a simplicial cone, and all cones are of such a form. We also show that the maximality of any weakly separated collection is preserved under the boundary map, which armatively answers a question by Early in \cite{E1}. Plabic graphs, invented by Postnikov \cite{P}, are of use in proving this result. As a…
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.
Taxonomy
TopicsCryptography and Data Security · Coding theory and cryptography · Complexity and Algorithms in Graphs
