![]() |
Discrete Mathematics & Theoretical Computer Science |
It was proved by Rubey that the number of fillings with zeros and ones of a given moon polyomino thatdo not contain a northeast chain of a fixed size depends only on the set of column lengths of the polyomino. Rubey’sproof uses an adaption of jeu de taquin and promotion for arbitrary fillings of moon polyominoes and deduces theresult for 01-fillings via a variation of the pigeonhole principle. In this paper we present the first completely bijectiveproof of this result by considering fillings of almost-moon polyominoes, which are moon polyominoes after removingone of the rows. More precisely, we construct a simple bijection which preserves the size of the largest northeast chainof the fillings when two adjacent rows of the polyomino are exchanged. This bijection also preserves the column sumof the fillings. In addition, we also present a simple bijection that preserves the size of the largest northeast chains, therow sum and the column sum if every row of the filling has at most one 1. Thereby, we not only provide a bijectiveproof of Rubey’s result but also two refinements of it.
Source : ScholeXplorer
IsRelatedTo ARXIV math/0602195 Source : ScholeXplorer IsRelatedTo DOI 10.1007/s00493-007-2297-2 Source : ScholeXplorer IsRelatedTo DOI 10.1016/j.endm.2007.01.002 Source : ScholeXplorer IsRelatedTo DOI 10.48550/arxiv.math/0602195
|