Enumerating permutations avoiding three Babson-Steingrímsson patterns
From MaRDI portal
Publication:2576462
DOI10.1007/s00026-005-0246-6zbMath1077.05002MaRDI QIDQ2576462
Antonio Bernini, Renzo Pinzani, Luca Ferrari
Publication date: 13 December 2005
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00026-005-0246-6
Related Items
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, Refined enumeration of permutations sorted with two stacks and a \(D_8\)-symmetry, Some combinatorics related to central binomial coefficients: Grand-Dyck paths, coloured noncrossing partitions and signed pattern avoiding permutations, Posets and permutations in the duplication-loss model: minimal permutations with \(d\) descents, A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations, Wilf equivalences between vincular patterns in inversion sequences