Pattern-Avoiding Involutions: Exact and Asymptotic Enumeration

Abstract

We consider the enumeration of pattern-avoiding involutions, focusing in particular on sets defined by avoiding a single pattern of length 4. As we demonstrate, the numerical data for these problems demonstrates some surprising behavior. This strange behavior even provides some very unexpected data related to the number of 1324-avoiding permutations.

References in corpus (2)

• On the growth rate of 1324-avoiding permutations
• A new record for $1324$-avoiding permutations

Cited by in corpus (8)

• Pattern avoidance is not P-recursive
• Stable characters from permutation patterns
• Pattern avoiding alternating involutions
• Asymptotic distribution of fixed points of pattern-avoiding involutions
• On pattern avoidance in matchings and involutions
• Deflatability of Permutation Classes
• Patterns in Permutations and Involutions: A Structural and Enumerative Approach
• On the centrosymmetric permutations in a class