Abstract
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 \({{\mathbb{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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chen W.Y.C., Wu S.Y.J., Yan C.H.: Linked partitions and linked cycles. European J. Combin. 29(6), 1408–1426 (2008)
Corteel S.: Crossings and alignments of permutations. Adv. Appl. Math. 38(2), 149–163 (2007)
De Mier A.: On the symmetry of the distribution of \({k}\)-crossings and \({k}\)-nestings in graphs. Electron. J. Combin. 13(1), #N21 (2006)
De Mier A.: \({k}\)-noncrossings and \({k}\)-nonnestings graphs and fillings of ferrers diagrams. Combinatorica 27(6), 699–720 (2007)
De Sainte-Catherine, M: Couplages et Pfaffiens en combinatoire, physique et informatique. Ph.D. Thesis. University of Bordeaux I (1983)
Kasraoui A.: Ascents and descents in 01-fillings of moon polyominoes. European J. Combin. 31(1), 87–105 (2010)
Kasraoui A., Zeng J.: Distribution of crossings, nestings and alignments of two edges in matchings and partitions. Electron. J. Combin. 13(1), #R33 (2006)
Klazar M.: On identities concerning the number of crossings and nestings of two edges in matchings. SIAM J. Discrete Math. 20(4), 960–976 (2006)
Phillipson M., Yan C.H., Yeh J.: Chains of length 2 in fillings of layer polyominoes. Electron. J. Combin. 20(3), #P51 (2013)
Poznanović S., Yan C.: Crossings and nestings of two edges in set partitions. SIAM J. Discrete Math. 23(2), 787–804 (2009)
Poznanović S., Yan C.: Maximal increasing sequences in fillings of almost-moon polyominoes. Adv. Appl. Math. 66, 1–21 (2015)
Rubey M.: Increasing and decreasing sequences in fillings of moon polyominoes. Adv. Appl. Math. 47(1), 57–87 (2011)
Stanley R.P.: Enumerative Combinatorics. Volume 2. Cambridge University Press, Cambridge (1999)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Phillipson, M., Yan, C.H. Avoiding Monotone Chains in Fillings of Layer Polyominoes. Ann. Comb. 20, 883–897 (2016). https://doi.org/10.1007/s00026-016-0326-9
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00026-016-0326-9