Avoiding monotone chains in fillings of layer polyominoes

DOI10.1007/s00026-016-0326-9zbMath1354.05013OpenAlexW2478248029MaRDI QIDQ505702

Mitch Phillipson, Catherine Huafei Yan

Publication date: 26 January 2017

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00026-016-0326-9

zbMATH Keywords

noncrossingpolyominononnestingfillings

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Polyominoes (05B50)

Cites Work

• Unnamed Item
• Chains of length 2 in fillings of layer polyominoes
• Increasing and decreasing sequences in fillings of moon polyominoes
• On the symmetry of the distribution of \(k\)-crossings and \(k\)-nestings in graphs
• Linked partitions and linked cycles
• \(k\)-noncrossing and \(k\)-nonnesting graphs and fillings of Ferrers diagrams
• Ascents and descents in 01-fillings of moon polyominoes
• Maximal increasing sequences in fillings of almost-moon polyominoes
• Distribution of crossings, nestings and alignments of two edges in matchings and partitions
• Crossings and alignments of permutations
• Crossings and Nestings of Two Edges in Set Partitions
• On Identities Concerning the Numbers of Crossings and Nestings of Two Edges in Matchings

This page was built for publication: Avoiding monotone chains in fillings of layer polyominoes