Permutation classes

2014/09/17 by Vatter, Vincent · 8 citations
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1409.5159

Abstract

This is a survey on permutation classes for the upcoming book Handbook of Enumerative Combinatorics.

Cited by

• On the growth rate of the Stanley-Wilf limit of blockable permutations
• Growing Avoiders from the Right: An Operator-Theoretic Approach
• Polynomials Arising from Sorted Binomial Coefficients
• Cyclomatic numbers and permutations
• An Erdős--Szekeres type result for words with repeats
• Combinatorial equivalence of separable elements in types A and B
• Permuton and local limits for the Luce model
• Permutation patterns in streams

Related

• A Survey of Simple Permutations
• An Introduction to Permutation Processes (version 0.5)
• The enumeration of permutations avoiding 2143 and 4231
• On the effective and automatic enumeration of polynomial permutation\n classes
• Generating and enumerating 321-avoiding and skew-merged simple permutations