Bijection between increasing binary trees and rook placements on double staircases (Q2111784)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7642888
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bijection between increasing binary trees and rook placements on double staircases |
scientific article; zbMATH DE number 7642888 |
Statements
Bijection between increasing binary trees and rook placements on double staircases (English)
0 references
17 January 2023
0 references
Summary: In this paper, we shall construct a bijection between rook placements on double staircases (introduced by \textit{M. Josuat-Vergès} [Discrete Math. Theor. Comput. Sci. 19, No. 3, Paper No. 3, 22 p. (2017; Zbl 1401.05305)]) 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 \textit{V. Tewari} [J. Comb. Theory, Ser. A 163, 98--117 (2019; Zbl 1403.05068)].
0 references
Young's lattice
0 references
tableaux
0 references
growth diagrams
0 references
Dyck paths
0 references
0 references
0 references
0.7401789426803589
0 references
0.7354933619499207
0 references
0.7294463515281677
0 references
0.7131291031837463
0 references
0.7116761207580566
0 references