Sparse Paving Positroids
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866915616623951872 |
|---|---|
| author | Machacek, John Nasr, George D. |
| author_facet | Machacek, John Nasr, George D. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_10812 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Sparse Paving Positroids Machacek, John Nasr, George D. Combinatorics 05B35 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. |
| title | Sparse Paving Positroids |
| topic | Combinatorics 05B35 |
| url | https://arxiv.org/abs/2511.10812 |