Permutations avoiding certain patterns: The case of length 4 and some generalizations

DOI10.1016/S0012-365X(96)00140-9zbMath0888.05002MaRDI QIDQ1377745

Miklós Bóna

Publication date: 1 June 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

patternnumbers of permutations

Mathematics Subject Classification ID

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

Related Items (22)

Restricted permutations and queue jumping ⋮ A simplification to Fredholm's solution to the Fredholm integral equation of the second kind ⋮ Unnamed Item ⋮ The number of permutations with exactly \(r\) 132-subsequences is \(P\)-recursive in the size! ⋮ Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps ⋮ Permutations with one or two 132-subsequences ⋮ The shape of random pattern-avoiding permutations ⋮ Finite transition matrices for permutations avoiding pairs of length four patterns ⋮ Wilf equivalences for patterns in rooted labeled forests ⋮ Enumeration of permutations containing a prescribed number of occurrences of a pattern of length three ⋮ Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns ⋮ On the number of permutations avoiding a given pattern ⋮ Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind ⋮ Restricted permutations ⋮ On the Stanley--Wilf limit of 4231-avoiding permutations and a conjecture of Arratia ⋮ Posets and permutations in the duplication-loss model: minimal permutations with \(d\) descents ⋮ The limit of a Stanley-Wilf sequence is not always rational, and layered patterns beat monotone patterns ⋮ Permutations restricted by two distinct patterns of length three ⋮ The solution of a conjecture of Stanley and Wilf for all layered patterns ⋮ Shape avoiding permutations ⋮ A new class of Wilf-equivalent permutations ⋮ Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations

Cites Work

• Pattern matching for permutations
• Forbidden subsequences
• Asymptotic values for degrees associated with strips of Young diagrams
• Permutations with forbidden subsequences and nonseparable planar maps
• Wilf-equivalence for singleton classes
• Restricted permutations

This page was built for publication: Permutations avoiding certain patterns: The case of length 4 and some generalizations