Permutations avoiding certain patterns: The case of length 4 and some generalizations
type: Item
instance of: scholarly article
title: Permutations avoiding certain patterns: The case of length 4 and some generalizations
zbMATH Open document ID: 0888.05002
DOI: 10.1016/S0012-365X(96)00140-9
author: Miklós Bóna
published in: Discrete Mathematics
publication date: 1998-06-01T00:00:00Z
review text: The author gives a characterization of the numbers of permutations avoiding each pattern of length 4. We quote here some of his results: (1) \(S_n(1234)< S_n(1324)\) for all \(n\geq 7\). Moreover, \(S_n(1234)\) is asymptotically smaller than \(S_n(1324)\). (2) \(S_n(1324)< 36^n\) for all \(n\). (3) \(S_n(1423)< S_n(1234)\) for all \(n\geq 6\). Moreover, \(S_n(1423)\) is asymptotically smaller than \(S_n(1234)\). For longer patterns some implications are included.
reviewed by: Mirela Ştefănescu
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 05A15
zbMATH DE Number: 1110011
zbMATH Keywords: numbers of permutations
zbMATH Keywords: pattern
MaRDI profile type: Publication
cites work: Pattern matching for permutations
cites work: Asymptotic values for degrees associated with strips of Young diagrams
cites work: Restricted permutations
cites work: Forbidden subsequences
cites work: Permutations with forbidden subsequences and nonseparable planar maps
cites work: Wilf-equivalence for singleton classes
description: scientific article; zbMATH DE number 1110011