Shape avoiding permutations

Authors:
Ron M. Adin;Yuval Roichman
Affiliations:
Department of Mathematics and Computer Science, Bar-Ilan University, Ramat-Gan, Israel;Department of Mathematics and Computer Science, Bar-Ilan University, Ramat-Gan, Israel
Venue:
Journal of Combinatorial Theory Series A
Year:
2002

Citing 6
Cited 0

Enumerative combinatorics

Enumerative combinatorics
Permutations avoiding certain patterns: the case of length 4 and some generalizations

Discrete Mathematics
Exact enumeration of 1342-avoiding permutations: a close link with labeled trees and planar maps

Journal of Combinatorial Theory Series A
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
The solution of a conjecture of Stanley and Wilf for all layered patterns

Journal of Combinatorial Theory Series A
On the number of permutations avoiding a given pattern

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.00

Visualization

Abstract

Permutations avoiding all patterns of a given shape (in the sense of Robinson, Schensted, and Knuth) are considered. We show that the shapes of all such permutations are contained in a suitable thick hook and deduce an exponential growth rate for their number.