On bijections for pattern-avoiding permutations

DOI10.1016/j.jcta.2009.03.006zbMath1181.05002OpenAlexW2015282370MaRDI QIDQ1040843

J. Blot

Publication date: 26 November 2009

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2009.03.006

zbMATH Keywords

fixed pointbijectionexcedancepattern-avoiding permutation

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items

Major index distribution over permutation classes, Unimodal permutations and almost-increasing cycles, Equidistribution of set-valued statistics on standard Young tableaux and transversals, Further refinements of Wilf-equivalence for patterns of length 4, A refinement of Wilf-equivalence for patterns of length 4, Descent sets on 321-avoiding involutions and hook decompositions of partitions, Pattern avoidance and Young tableaux, On a refinement of Wilf-equivalence for permutations, Counting permutations with no long monotone subsequence via generating trees and the kernel method, Another look at bijections for pattern-avoiding permutations, Restricted permutations refined by number of crossings and nestings

Uses Software

• AARON

Cites Work

• Unnamed Item
• Bijections for refined restricted permutations
• Refined restricted permutations
• Restricted permutations from Catalan to Fine and back
• Decreasing subsequences in permutations and Wilf equivalence for involutions
• Wilf-equivalence for singleton classes
• Permutations with restricted patterns and Dyck paths