Asymptotic distribution of fixed points of pattern-avoiding involutions
From MaRDI portal
Abstract: For a variety of pattern-avoiding classes, we describe the limiting distribution for the number of fixed points for involutions chosen uniformly at random from that class. In particular we consider monotone patterns of arbitrary length as well as all patterns of length 3. For monotone patterns we utilize the connection with standard Young tableaux with at most rows and involutions avoiding a monotone pattern of length . For every pattern of length 3 we give the bivariate generating function with respect to fixed points for the involutions that avoid that pattern, and where applicable apply tools from analytic combinatorics to extract information about the limiting distribution from the generating function. Many well-known distributions appear.
Recommendations
Cited in
(9)- The number of involutions with \(r\) fixed points and a long increasing subsequence
- Almost square permutations are typically square
- Permutations avoiding 312 and another pattern, Chebyshev polynomials and longest increasing subsequences
- Square permutations are typically rectangular
- scientific article; zbMATH DE number 6826143 (Why is no real title available?)
- Fixed points of 321-avoiding permutations
- Longest increasing subsequences in involutions avoiding patterns of length three
- A Galton-Watson tree approach to local limits of permutations avoiding a pattern of length three
- Refined restricted involutions
This page was built for publication: Asymptotic distribution of fixed points of pattern-avoiding involutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4560187)