Avoiding monotone chains in fillings of layer polyominoes
From MaRDI portal
Publication:505702
DOI10.1007/S00026-016-0326-9zbMATH Open1354.05013OpenAlexW2478248029MaRDI QIDQ505702FDOQ505702
Authors: Mitch Phillipson, Catherine 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Distribution of crossings, nestings and alignments of two edges in matchings and partitions
- Crossings and alignments of permutations
- On the symmetry of the distribution of \(k\)-crossings and \(k\)-nestings in graphs
- \(k\)-noncrossing and \(k\)-nonnesting graphs and fillings of Ferrers diagrams
- Ascents and descents in 01-fillings of moon polyominoes
- Crossings and nestings of two edges in set partitions
- On Identities Concerning the Numbers of Crossings and Nestings of Two Edges in Matchings
- Increasing and decreasing sequences in fillings of moon polyominoes
- Linked partitions and linked cycles
- Chains of length 2 in fillings of layer polyominoes
- Maximal increasing sequences in fillings of almost-moon polyominoes
Cited In (3)
This page was built for publication: Avoiding monotone chains in fillings of layer polyominoes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q505702)
