Pattern-avoiding inversion sequences and open partition diagrams
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2107707 (Why is no real title available?)
- A generating tree approach to k-nonnesting partitions and permutations
- Baxter permutations and plane bipolar orientations
- Bijections for Baxter families and related objects
- Bijections for inversion sequences, ascent sequences and 3-nonnesting set partitions
- Crossings and nestings of matchings and partitions
- Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers
- Enumeration of inversion sequences avoiding triples of relations
- Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels
- Generalized permutation patterns and a classification of the Mahonian statistics
- Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes
- Pattern avoidance in inversion sequences
- Patterns in inversion sequences. I.
- Patterns in inversion sequences. II: Inversion sequences avoiding triples of relations
- Patterns in permutations and words.
- Refined enumeration of permutations sorted with two stacks and a D₈-symmetry
- Restricted inversion sequences and enhanced 3-noncrossing partitions
- Tableau sequences, open diagrams, and Baxter families
- The number of Baxter permutations
Cited in
(5)- Proof of Dilks' bijectivity conjecture on Baxter permutations
- Combinatorics of the symmetries of ascents in restricted inversion sequences
- On some combinatorial sequences associated to invariant theory
- Restricted inversion sequences and enhanced 3-noncrossing partitions
- Bijections for inversion sequences, ascent sequences and 3-nonnesting set partitions
This page was built for publication: Pattern-avoiding inversion sequences and open partition diagrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2202026)
