Avoiding Monotone Chains in Fillings of Layer Polyominoes

abstract

• 2016, Springer International Publishing. In this paper we give simple bijective proofs that the number of fillings of layer polyominoes with no northeast chains is the same as the number with no southeast chains. We consider 01-fillings and N-fillings and prove the results for both strong chains where the smallest rectangle containing the chain is also in the polyomino, and for regular chains where only the corners of the smallest rectangle containing the chain are required to be in the polyomino.

authors

• Yan, Catherine

published proceedings

• ANNALS OF COMBINATORICS

author list (cited authors)

• Phillipson, M., & Yan, C. H.

citation count

• 0

complete list of authors

• Phillipson, Mitch||Yan, Catherine H

publication date

• December 2016

publisher

• Springer Nature  Publisher

published in

• Annals of Combinatorics  Journal

keywords

• Fillings
• Noncrossing
• Nonnesting
• Polyomino

Digital Object Identifier (DOI)

• 10.1007/s00026-016-0326-9

start page

• 883

end page

• 897

volume

• 20

issue

• 4

URL

• https://doi.org/10.1007/s00026-016-0326-9