A Survey of Simple Permutations
classification
🧮 math.CO
keywords
permutationssimpleclassesfinitelynumberresultssurveycontaining
read the original abstract
We survey the known results about simple permutations. In particular, we present a number of recent enumerative and structural results pertaining to simple permutations, and show how simple permutations play an important role in the study of permutation classes. We demonstrate how classes containing only finitely many simple permutations satisfy a number of special properties relating to enumeration, partial well-order and the property of being finitely based.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.