Bijections on m-level Rook Placements
From MaRDI portal
Publication:4584138
zbMATH Open1393.05050arXiv1508.05944MaRDI QIDQ4584138
Kenneth Barrese, Bruce E. Sagan
Publication date: 29 August 2018
Abstract: Suppose the rows of a board are partitioned into sets of m rows called levels. An m-level rook placement is a subset of the board where no two squares are in the same column or the same level. We construct explicit bijections to prove three theorems about such placements. We start with two bijections between Ferrers boards having the same number of m-level rook placements. The first generalizes a map by Foata and Sch"utzenberger and our proof applies to any Ferrers board. This bijection also preserves the m-inversion number statistic of an m-level rook placement, defined by Briggs and Remmel. The second generalizes work of Loehr and Remmel. This construction only works for a special class of Ferrers boards, but it yields a formula for calculating the rook numbers of these boards in terms of elementary symmetric functions. Finally we generalize another result of Loehr and Remmel giving a bijection between boards with the same hit numbers. The second and third bijections involve the Involution Principle of Garsia and Milne.
Full work available at URL: https://arxiv.org/abs/1508.05944
Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)
Related Items (2)
ROOK PLACEMENTS AND CLASSIFICATION OF PARTITION VARIETIES B\ Mλ ⋮ A simple bijection between 231-avoiding and 312-avoiding placements
This page was built for publication: Bijections on m-level Rook Placements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4584138)