\(k\)-noncrossing and \(k\)-nonnesting graphs and fillings of Ferrers diagrams
From MaRDI portal
Publication:950332
DOI10.1007/s00493-007-2297-2zbMath1164.05002MaRDI QIDQ950332
Publication date: 22 October 2008
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-007-2297-2
05A19: Combinatorial identities, bijective combinatorics
05A17: Combinatorial aspects of partitions of integers
05E10: Combinatorial aspects of representation theory
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C07: Vertex degrees
Related Items
A generating tree approach to \(k\)-nonnesting partitions and permutations, Positive and negative chains in charged moon polyominoes, Chains of length 2 in fillings of layer polyominoes, Linked partitions and permutation tableaux, Crossings and nestings for arc-coloured permutations and automation, Avoiding monotone chains in fillings of layer polyominoes, Increasing and decreasing sequences in fillings of moon polyominoes, Vacillating Hecke tableaux and linked partitions, The combinatorics of associated Hermite polynomials, Ascents and descents in 01-fillings of moon polyominoes, Pattern avoidance in matchings and partitions, Major index for 01-fillings of moon polyominoes, Maximal increasing sequences in fillings of almost-moon polyominoes, Derangements on a Ferrers board
Cites Work
- Increasing and decreasing sequences in fillings of moon polyominoes
- Dyck paths and pattern-avoiding matchings
- Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes
- On the symmetry of the distribution of \(k\)-crossings and \(k\)-nestings in graphs
- A spherical initial ideal for Pfaffians
- Counting pattern-free set partitions. II: Noncrossing and other hypergraphs
- A new class of Wilf-equivalent permutations
- Decreasing subsequences in permutations and Wilf equivalence for involutions
- Distribution of crossings, nestings and alignments of two edges in matchings and partitions
- Generalized triangulations and diagonal-free subsets of stack polyominoes
- Wilf-equivalence for singleton classes
- Crossings and nestings of matchings and partitions
- On Identities Concerning the Numbers of Crossings and Nestings of Two Edges in Matchings
