Fixed points of 321-avoiding permutations
From MaRDI portal
Publication:4644469
Abstract: We describe the distribution of the number and location of the fixed points of permu- tations that avoid the pattern 321 via a bijection with rooted plane trees on n + 1 vertices. Using the local limit theorem for Galton-Watson trees, we are able to give an explicit description of the limit of this distribution.
Recommendations
- Pattern-avoiding permutations and Brownian excursion. II: Fixed points
- Asymptotic distribution of fixed points of pattern-avoiding involutions
- Patterns in random permutations avoiding the pattern 321
- Fixed points and excedances in restricted permutations
- Patterns in random permutations avoiding the pattern 132
Cites work
- scientific article; zbMATH DE number 1713116 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- Arbres et processus de Galton-Watson. (Trees and Galton-Watson processes)
- Bijections for refined restricted permutations
- Combinatorics of permutations
- Conceptual proofs of \(L\log L\) criteria for mean behavior of branching processes
- Fixed points and excedances in restricted permutations
- Large deviations for permutations avoiding monotone patterns
- Local limits of conditioned Galton-Watson trees: the infinite spine case
- Longest monotone subsequences and rare regions of pattern-avoiding permutations
- Multiple pattern avoidance with respect to fixed points and excedances
- Pattern-avoiding permutations and Brownian excursion. I: Shapes and fluctuations.
- Pattern-avoiding permutations and Brownian excursion. II: Fixed points
- Patterns in random permutations avoiding the pattern 132
- Permutations with restricted patterns and Dyck paths
- Refined restricted permutations
- Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
- Structure of random \(312\)-avoiding permutations
- Subdiffusive behavior of random walk on a random cluster
- The Brownian limit of separable permutations
- The Galton-Watson process conditioned on the total progeny
- The shape of random pattern-avoiding permutations
- Tree-valued Markov chains derived from Galton-Watson processes
Cited in
(18)- On fixed points of permutations.
- Scaling and local limits of Baxter permutations and bipolar orientations through coalescent-walk processes
- A Galton-Watson tree approach to local limits of permutations avoiding a pattern of length three
- Asymptotic distribution of fixed points of pattern-avoiding involutions
- Fixed points and excedances in restricted permutations
- A decorated tree approach to random permutations in substitution-closed classes
- Square permutations are typically rectangular
- A logical limit law for \(231\)-avoiding permutations
- Almost square permutations are typically square
- Longest increasing subsequences in involutions avoiding patterns of length three
- Pattern-avoiding permutations and Brownian excursion. II: Fixed points
- Inversion formulae on permutations avoiding 321
- Highly sorted permutations with respect to a 312-avoiding stack
- Permutations avoiding 312 and another pattern, Chebyshev polynomials and longest increasing subsequences
- A discontinuity in the distribution of fixed point sums
- Rowmotion on 321-avoiding permutations
- Local convergence for permutations and local limits for uniform \(\rho \)-avoiding permutations with \(|\rho |=3\)
- Local limit of the fixed point forest
This page was built for publication: Fixed points of 321-avoiding permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4644469)
