On bijections for pattern-avoiding permutations

DOI10.1016/J.JCTA.2009.03.006MaRDI QIDQ1040843zbMATH OpenOpenAlexFDO

Authors 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

bijectionexcedancefixed pointpattern-avoiding permutation

Mathematics Subject Classification ID

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

Recommendations

• Another look at bijections for pattern-avoiding permutations
• On two bijections from \(S_{n}(321)\) to \(S_{n}(132)\).
• Bijections for refined restricted permutations
• On the diagram of 132-avoiding permutations
• Classification of bijections between 321- and 132-avoiding permutations

Cites work

• Bijections for refined restricted permutations
• Decreasing subsequences in permutations and Wilf equivalence for involutions
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• Permutations with restricted patterns and Dyck paths
• Refined restricted permutations
• Restricted permutations from Catalan to Fine and back
• Wilf-equivalence for singleton classes

Cited in

(26)

• Finite transition matrices for permutations avoiding pairs of length four patterns
• Statistics-preserving bijections between classical and cyclic permutations
• On a refinement of Wilf-equivalence for permutations
• On pattern-avoiding Fishburn permutations
• Unimodal permutations and almost-increasing cycles
• Pattern avoidance in multiset permutations: bijective proof
• A refinement of Wilf-equivalence for patterns of length 4
• Classification of bijections between 321- and 132-avoiding permutations
• On permutations avoiding partially ordered patterns defined by bipartite graphs
• A simple bijection between 312-avoiding permutations and triangulations
• scientific article; zbMATH DE number 6683606 (Why is no real title available?)
• Major index distribution over permutation classes
• Descent sets on 321-avoiding involutions and hook decompositions of partitions
• Classification of bijections between 321- and 132-avoiding permutations
• On the sub-permutations of pattern avoiding permutations
• Pattern avoidance and Young tableaux
• Counting permutations with no long monotone subsequence via generating trees and the kernel method
• Bijections for refined restricted permutations
• A bijection for length-5 patterns in permutations
• Equidistribution of set-valued statistics on standard Young tableaux and transversals
• Further refinements of Wilf-equivalence for patterns of length 4
• Fixed points and excedances in restricted permutations
• On (joint) equidistributions of mesh patterns 123 and 132 with symmetric shadings
• Restricted permutations refined by number of crossings and nestings
• On bijections between 231-avoiding permutations and Dyck paths
• Another look at bijections for pattern-avoiding permutations

Describes a project that uses

Uses Software

• AARON

This page was built for publication: On bijections for pattern-avoiding permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1040843)