Tiered tree, Parking function and Postnikov-Shapiro algebra
Combinatorics
2024-08-07 v1
Abstract
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 for complete tiered graphs and described tiered graphs in terms of Whitney's operations.
Cite
@article{arxiv.2408.03087,
title = {Tiered tree, Parking function and Postnikov-Shapiro algebra},
author = {Biswadeep Bagchi and Srinibas Swain},
journal= {arXiv preprint arXiv:2408.03087},
year = {2024}
}