Pattern-avoiding permutations and Brownian excursion. II: Fixed points

DOI10.1007/S00440-016-0732-2zbMATH Open1407.60017arXiv1506.04174OpenAlexW2963689107MaRDI QIDQ682805FDOQ682805

Douglas Rizzolo, Erik Slivken, Christopher Hoffman

Publication date: 5 February 2018

Published in: Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete (Search for Journal in Brave)

Abstract: Permutations that avoid given patterns are among the most classical objects in combinatorics and have strong connections to many fields of mathematics, computer science and biology. In this paper we study fixed points of both 123- and 231-avoiding permutations. We find an exact description for a scaling limit of the empirical distribution of fixed points in term of Brownian excursion. This builds on the connections between pattern-avoiding permutations and Brownian excursion developed in Part I of this series and strengthens the recent results of Elizalde (2012) and Miner and Pak (2014) on fixed points of pattern-avoiding permutations.

Full work available at URL: https://arxiv.org/abs/1506.04174

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Enumerative combinatorics (05A99) Combinatorial probability (60C05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bijections for refined restricted permutations
• Brownian Motion
• Permutations with restricted patterns and Dyck paths
• Some combinatorial properties of Schubert polynomials
• The depth first processes of Galton-Watson trees converge to the same Brownian excursion
• An invariance principle for random walk conditioned by a late return to zero
• Excursions in Brownian motion
• Fixed points and excedances in restricted permutations
• Exchangeable pairs and Poisson approximation
• Multiple pattern avoidance with respect to fixed points and excedances
• Title not available (Why is that?)
• The shape of random pattern-avoiding permutations
• Structure of random \(312\)-avoiding permutations
• Pattern‐avoiding permutations and Brownian excursion part I: Shapes and fluctuations
• Schröder’s problems and scaling limits of random trees
• Asymptotics of Bernoulli random walks, bridges, excursions and meanders with a given number of peaks

Cited In (15)

• A view from the bridge spanning combinatorics and probability
• Arcsine laws for random walks generated from random permutations with applications to genomics
• Local convergence for permutations and local limits for uniform \(\rho \)-avoiding permutations with \(|\rho |=3\)
• The Brownian limit of separable permutations
• Permutations, signs and the Brownian bridge
• Universal limits of substitution-closed permutation classes
• A logical limit law for \(231\)-avoiding permutations
• Square permutations are typically rectangular
• Fixed points of 321-avoiding permutations
• Sorting probability of Catalan posets
• A Galton-Watson tree approach to local limits of permutations avoiding a pattern of length three
• A decorated tree approach to random permutations in substitution-closed classes
• Pattern‐avoiding permutations and Brownian excursion part I: Shapes and fluctuations
• Permutations avoiding 312 and another pattern, Chebyshev polynomials and longest increasing subsequences
• Almost square permutations are typically square

This page was built for publication: Pattern-avoiding permutations and Brownian excursion. II: Fixed points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q682805)