On the number of permutations avoiding a given pattern

DOI10.1006/jcta.1999.3002zbMath0948.05003OpenAlexW2021480278MaRDI QIDQ1971017

Ehud Friedgut, Noga Alon

Publication date: 19 November 2000

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.1999.3002

zbMATH Keywords

permutationpatternDavenport-Schinzel sequences

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial inequalities (05A20)

Related Items (16)

A simple proof for the exponential upper bound for some tenacious patterns ⋮ On avoiding 1233 ⋮ Pattern avoidance in poset permutations ⋮ Excluded permutation matrices and the Stanley-Wilf conjecture ⋮ A probabilistic approach to consecutive pattern avoiding in permutations ⋮ Degrees of nonlinearity in forbidden 0-1 matrix problems ⋮ Forbidden paths and cycles in ordered graphs and matrices ⋮ Large Deviations and Ratio Limit Theorems for Pattern-Avoiding Permutations ⋮ Counting occurrences of 231 in an involution ⋮ Asymptotic enumeration of permutations avoiding generalized patterns ⋮ Finite automata and pattern avoidance in words ⋮ Restricted \(k\)-ary words and functional equations ⋮ Quasirandom permutations ⋮ Pattern occurrences in \(k\)-ary words revisited: a few new and old observations ⋮ Shape avoiding permutations ⋮ Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations

Cites Work

• Unnamed Item
• Unnamed Item
• The solution of a conjecture of Stanley and Wilf for all layered patterns
• Generalized Davenport-Schinzel sequences
• Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
• Permutations avoiding certain patterns: The case of length 4 and some generalizations
• Asymptotic values for degrees associated with strips of Young diagrams
• Restricted permutations

This page was built for publication: On the number of permutations avoiding a given pattern