Enumeration schemes for permutations avoiding barred patterns
From MaRDI portal
Publication:2380461
zbMath1215.05006MaRDI QIDQ2380461
Publication date: 26 March 2010
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/226050
Related Items (9)
Semi-Baxter and Strong-Baxter: Two Relatives of the Baxter Sequence ⋮ Permutations weakly avoiding barred patterns and combinatorial bijections to generalized Dyck and Motzkin paths ⋮ Refining enumeration schemes to count according to permutation statistics ⋮ The number of {1243, 2134}-avoiding permutations ⋮ Enumeration schemes for vincular patterns ⋮ Vincular pattern avoidance on cyclic permutations ⋮ Semi-Baxter and strong-Baxter permutations ⋮ Refining the bijections among ascent sequences, (2+2)-free posets, integer matrices and pattern-avoiding permutations ⋮ Combinatorial generation via permutation languages. I. Fundamentals
Uses Software
This page was built for publication: Enumeration schemes for permutations avoiding barred patterns
