Bijection between Increasing Binary Trees and Rook Placements on Double Staircases

arxiv(2023)

引用 0|浏览2
暂无评分
摘要
In this paper, we shall construct a bijection between rook placements on double staircases (introduced by Josuat-Verg\`es in 2017) and increasing binary trees. We introduce two subclasses of rook placements on double staircases, which we call left and right-aligned rook placements. We show that their enumeration, while keeping track of a certain statistic, gives the $\gamma$-vectors of the Eulerian polynomials. We conclude with a discussion on a different bijection that fits in very well with our main bijection, and another discussion on generalising our main bijection. Our main bijection is a special case of a bijection due to Tewari (2019).
更多
查看译文
关键词
rook placements,double staircases,binary trees
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要