Bijections for refined restricted permutations

Authors:
Sergi Elizalde;Igor Pak
Affiliations:
Department of Mathematics, MIT, Cambridge, MA;Department of Mathematics, MIT, Cambridge, MA
Venue:
Journal of Combinatorial Theory Series A
Year:
2004

Citing 6
Cited 3

Enumerative combinatorics

Enumerative combinatorics
Generating trees and the Catalan and Schro¨der numbers

Discrete Mathematics
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Permutations with Restricted Patterns and Dyck Paths

Advances in Applied Mathematics
A survey of the Fine numbers

Discrete Mathematics
Enumeration of permutations containing a prescribed number of occurrences of a pattern of length three

Advances in Applied Mathematics

Refined sign-balance on 321-avoiding permutations

European Journal of Combinatorics - Special issue on combinatorics and representation theory
On bijections for pattern-avoiding permutations

Journal of Combinatorial Theory Series A
Counting permutations with no long monotone subsequence via generating trees and the kernel method

Journal of Algebraic Combinatorics: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a bijection between 321- and 132-avoiding permutations that preserves the number of fixed points and the number of excedances. This gives a simple combinatorial proof of recent results of Robertson et al. (Ann. Combin. 6 (2003) 427), and Elizalde (Proc. FPSAC 2003). We also show that our bijection preserves additional statistics, which extends the previous results.