Pattern-avoiding involutions: exact and asymptotic enumeration
From MaRDI portal
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.
Recommendations
- Pattern avoiding alternating involutions
- On permutations avoiding 1324, 2143, and another 4-letter pattern
- The fine structure of 4321 avoiding involutions and 321 avoiding involutions
- On permutations avoiding 1243, 2134, and another 4-letter pattern
- Permutations avoiding certain patterns: The case of length 4 and some generalizations
Cited in
(14)- Enumeration by stabilizer class of patterns with local restrictions
- Enumeration of vexillary involutions which are equal to their mirror/complement
- Stable characters from permutation patterns
- On pattern avoidance in matchings and involutions
- Pattern-restricted permutations composed of 3-cycles
- Some open problems on permutation patterns
- The fine structure of 4321 avoiding involutions and 321 avoiding involutions
- On the centrosymmetric permutations in a class
- Longest increasing subsequences in involutions avoiding patterns of length three
- Pattern avoiding alternating involutions
- On refinements of Wilf-equivalence for involutions
- Equidistribution of set-valued statistics on standard Young tableaux and transversals
- Combinatorics of exterior peaks on pattern-avoiding symmetric transversals
- First-order convergence for 321-avoiding permutations
This page was built for publication: Pattern-avoiding involutions: exact and asymptotic enumeration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2800768)
