Bijection between Increasing Binary Trees and Rook Placements on Double Staircases

Abstract

In this paper, we shall construct a bijection between rook placements on double staircases (introduced by Josuat-Vergès 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).

arXiv commentv2: Version accepted by the Electronic Journal of Combinatorics. v1: 20 pages, 6 figures, 4 tables (1 unnumbered)