Sparse paving positroids
American Journal of Combinatorics · 09.08.2026 · 5 · 70-80
DOI: 10.63151/amjc.v5i.42 ↗Kurz gefasst
Fachartikel in der Zeitschrift American Journal of Combinatorics, online erschienen am 09.08.2026. Verfasst von John Machacek und 1 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
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.
Zitieren
APA
Machacek, J., & Nasr, G. (2026). Sparse paving positroids. American Journal of Combinatorics, 5, 70-80. https://doi.org/10.63151/amjc.v5i.42
Vancouver
Machacek J, Nasr G. Sparse paving positroids. American Journal of Combinatorics. 2026;5:70-80. doi:10.63151/amjc.v5i.42
BibTeX
@article{Machacek2026,
author = {Machacek, John and Nasr, George},
title = {Sparse paving positroids},
journal = {American Journal of Combinatorics},
year = {2026},
volume = {5},
pages = {70--80},
doi = {10.63151/amjc.v5i.42}
}
EUVIMED