The infinite limit of random permutations avoiding patterns of length three

Abstract: For

a u i n S_{3}

, let

m u_{n}^{a u}

denote the uniformly random probability measure on the set of

a u

-avoiding permutations in

S_{n}

. Let

m a t h b b N^{*} = m a t h b b N c u p i n f t y

with an appropriate metric and denote by

S (m a t h b b N, m a t h b b N^{*})

the compact metric space consisting of functions

s i g m a = {s i g m a_{i}}_{i = 1}^{i} n f t y

from

m a t h b b N

to

m a t h b b N^{*}

which are injections when restricted to

s i g m a^{- 1} (m a t h b b N)

m; that is, if

s i g m a_{i} = s i g m a_{j}

,

i e q j

, then

s i g m a_{i} = i n f t y

. Extending permutations

s i g m a i n S_{n}

by defining

s i g m a_{j} = j

, for

j > n

, we have

S_{n} s u b s e t S (m a t h b b N, m a t h b b N^{*})

. For each

a u i n S_{3}

, we study the limiting behavior of the measures

{m u_{n}^{a u}}_{n = 1}^{i} n f t y

on

S (m a t h b b N, m a t h b b N^{*})

.

Recommendations

Cites work

Cited in

(7)

This page was built for publication: The infinite limit of random permutations avoiding patterns of length three