On the number of permutations avoiding a given pattern

DOI10.1006/JCTA.1999.3002zbMATH Open0948.05003OpenAlexW2021480278MaRDI QIDQ1971017FDOQ1971017

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Restricted permutations
• Asymptotic values for degrees associated with strips of Young diagrams
• 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
• Generalized Davenport-Schinzel sequences
• The solution of a conjecture of Stanley and Wilf for all layered patterns

Cited In (20)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1971017)