Paper detail

Maximal increasing sequences in fillings of almost-moon polyominoes

It was proved by Rubey that the number of fillings with zeros and ones of a given moon polyomino that do not contain a northeast chain of size $k$ depends only on the set of columns of the polyomino, but not the shape of the polyomino. Rubey's proof is an adaption of jeu de taquin and promotion for arbitrary fillings of moon polyominoes. In this paper we present a bijective proof for this result by considering fillings of almost-moon polyominoes, which are moon polyominoes after removing one of the rows. Explicitly, we construct a bijection which preserves the size of the largest northeast chains of the fillings when two adjacent rows of the polyomino are exchanged. This bijection also preserves the column sum of the fillings. We also present a bijection that preserves the size of the largest northeast chains, the row sum and the column sum if every row of the fillings has at most one 1.