Sparse Paving Positroids
John Machacek, George D. Nasr

TL;DR
This paper classifies sparse paving positroids using combinatorial tools, enabling their enumeration and revealing connections to sequences involving the golden ratio and Lucas numbers.
Contribution
It introduces a classification method for sparse paving positroids and links their enumeration to well-known mathematical sequences.
Findings
Enumeration of sparse paving positroids
Connection to sequences involving the golden ratio
Relation to Lucas numbers
Abstract
Using Postnikov's Le-diagrams, decorated permutations, and Grassmann necklaces, we classify which positroids are sparse paving matroids. This allows us to enumerate sparse paving positroids, making connections to a known sequence involving the golden ratio and to the Lucas numbers.
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
TopicsAdvanced Combinatorial Mathematics · Advanced Mathematical Theories and Applications · Advanced Mathematical Identities
