Enumeration schemes for permutations avoiding barred patterns
From MaRDI portal
Publication:2380461
Recommendations
- Enumeration schemes for words avoiding permutations
- Enumeration schemes for vincular patterns
- The enumeration of permutations with a prescribed number of ``forbidden patterns
- Refining enumeration schemes to count according to the inversion number
- Enumerating permutations avoiding more than three Babson - Steingr\'\i msson patterns
Cited in
(14)- Permutations weakly avoiding barred patterns and combinatorial bijections to generalized Dyck and Motzkin paths
- Enumeration schemes for vincular patterns
- scientific article; zbMATH DE number 5072523 (Why is no real title available?)
- Semi-Baxter and strong-Baxter: two relatives of the Baxter sequence
- Classical sequences revisited with permutations avoiding dotted pattern
- Refining enumeration schemes to count according to permutation statistics
- Semi-Baxter and strong-Baxter permutations
- The number of {1243, 2134}-avoiding permutations
- Combinatorial parameters on bargraphs of permutations
- Vincular pattern avoidance on cyclic permutations
- Combinatorial generation via permutation languages. I: Fundamentals
- Refining the bijections among ascent sequences, (2+2)-free posets, integer matrices and pattern-avoiding permutations
- Refining enumeration schemes to count according to the inversion number
- The enumeration of permutations with a prescribed number of ``forbidden patterns
This page was built for publication: Enumeration schemes for permutations avoiding barred patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380461)