Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2408.03087 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909280565723136 |
|---|---|
| author | Bagchi, Biswadeep Swain, Srinibas |
| author_facet | Bagchi, Biswadeep Swain, Srinibas |
| contents | Tiered trees were introduced as a combinatorial object for counting absolutely indecomposable representation of certain quivers and torus orbit of certain homogeneous variety. In this paper, we define a bijection between the set of parallelogram polyominoes and graphical parking functions. Moreover, we defined the space $\mathcal{S}_{G}$ for complete tiered graphs and described tiered graphs in terms of Whitney's operations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_03087 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Tiered tree, Parking function and Postnikov-Shapiro algebra Bagchi, Biswadeep Swain, Srinibas Combinatorics Tiered trees were introduced as a combinatorial object for counting absolutely indecomposable representation of certain quivers and torus orbit of certain homogeneous variety. In this paper, we define a bijection between the set of parallelogram polyominoes and graphical parking functions. Moreover, we defined the space $\mathcal{S}_{G}$ for complete tiered graphs and described tiered graphs in terms of Whitney's operations. |
| title | Tiered tree, Parking function and Postnikov-Shapiro algebra |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2408.03087 |