The Infinite limit of random permutations avoiding patterns of length three

Research output: Contribution to journalArticlepeer-review

Abstract

For τ ∈ S3, let μτn denote the uniformly random probability measure on the set of τ-avoiding permutations in Sn. Let N = N ∪ {∞} with an appropriate metric and denote by S(N, N) the compact metric space consisting of functions σ = {σi}i=1 from N to N which are injections when restricted to σ−1(N); that is, if σi = σj, i = j, then σi = ∞. Extending permutations σ ∈ Sn by defining σj = j, for j > n, we have Sn ⊂ S(N, N). For each τ ∈ S3, we study the limiting behaviour of the measures {μτn}n=1 on S(N, N).

Original languageEnglish
Pages (from-to)137-152
Number of pages16
JournalCombinatorics Probability and Computing
Volume29
Issue number1
DOIs
StatePublished - 1 Jan 2020

Keywords

  • 05A05
  • 2010 MSC Codes:
  • Primary 60C05
  • Secondary 60B10

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Statistics and Probability
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'The Infinite limit of random permutations avoiding patterns of length three'. Together they form a unique fingerprint.

Cite this