Bijections for refined restricted permutations
Authors:
- Sergi ElizaldeSESergi Elizalde
- Igor PakIPIgor Pak
- 1 February 2004
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 105 (2) , 207-219
Abstract
No abstract availableAll Related Versions
This publication has 9 references indexed in Scilit:
- Enumeration of permutations containing a prescribed number of occurrences of a pattern of length threeAdvances in Applied Mathematics, 2003
- Refined Restricted PermutationsAnnals of Combinatorics, 2002
- Longest Increasing Subsequences in Pattern-Restricted PermutationsThe Electronic Journal of Combinatorics, 2002
- A survey of the Fine numbersDiscrete Mathematics, 2001
- Permutations with Restricted Patterns and Dyck PathsAdvances in Applied Mathematics, 2001
- Enumerative Combinatorics1997
- Generating trees and the Catalan and Schröder numbersDiscrete Mathematics, 1995
- Restricted PermutationsEuropean Journal of Combinatorics, 1985
- Longest Increasing and Decreasing SubsequencesCanadian Journal of Mathematics, 1961