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 terms of Brownian excursion. This builds on the connections between pattern-avoiding permutations and Brownian excursion developed in Hoffman et al. (Pattern-avoiding permutations and Brownian excursion, Part 1: Shapes and fluctuations. to appear Random Structures and Algorithms. arXiv:1406.5156, 2016) and strengthens the recent results of Elizalde (Electron J Comb 18(2):17, 2011) and Miner and Pak (Adv Appl Math 55:86–130, 2014) on fixed points of pattern-avoiding permutations.
Similar content being viewed by others
References
Billey, S.C., Jockusch, W., Stanley, R.P.: Some combinatorial properties of Schubert polynomials. J. Algebraic Comb. 2(4), 345–374 (1993)
Callan, D: Bijections from Dyck paths to 321-avoiding permutations revisited. arXiv:0711.2684 (2007)
Chatterjee, S., Diaconis, P., Meckes, E.: Exchangeable pairs and Poisson approximation. Probab. Surv. 2, 64–106 (2005)
Chung, K.L.: Excursions in Brownian motion. Arkiv för matematik 14(1), 155–177 (1976)
de Montmort, P.: Essai d’analyse sur les jeux de hazards. Chez Jacque Quillau (1713)
Elizalde, S.: Multiple pattern avoidance with respect to fixed points and excedances. Electron. J. Combin 11(1), 40 (2004)
Elizalde, S.: Statistics on pattern-avoiding permutations. PhD thesis, Massachusetts Institute of Technology (2004)
Elizalde, S.: Fixed points and excedances in restricted permutations. Electron. J. Comb. 18(2), 17 (2011)
Elizalde, S., Pak, I.: Bijections for refined restricted permutations. J. Comb. Theory Ser. A 105(2), 207–219 (2004)
Flajolet, P., Sedgewick, R.: Analytic combinatorics. Cambridge University Press, Cambridge (2009)
Hoffman, C., Rizzolo, D., Slivken, E.: Pattern-avoiding permutations and Brownian excursion, Part 1: shapes and fluctuations, to appear Random Structures and Algorithms. arXiv:1406.5156 (2016)
Janson, S.: Patterns in random permutations avoiding the pattern 132, to appear Combinatorics, Probability and Computing. arXiv:1401.5679 (2014)
Kaigh, W.D.: An invariance principle for random walk conditioned by a late return to zero. Ann. Probab. 4(1), 115–121 (1976)
Kallenberg, O.: Foundations of modern probability. Probability and its applications (New York), 2nd edn. Springer, New York (2002)
Knuth, D.E.: The art of computer programming. Vol. 1: fundamental algorithms. Second printing. Addison-Wesley Publishing Co., Reading, Mass.-London-Don Mills, Ont (1969)
Krattenthaler, C.: Permutations with restricted patterns and Dyck paths. Adv. Appl. Math 27, 510–530 (2001)
Labarbe, J.-M., Marckert, J.-F.: Asymptotics of Bernoulli random walks, bridges, excursions and meanders with a given number of peaks. Electron. J. Probab. 12, 229–261 (2007)
MacMahon, P.A.: Combinatory analysis. Cambridge University Press, Cambridge (1915)
Madras, N., Liu, H.: Random pattern-avoiding permutations. In: Algorithmic probability and combinatorics. AMS, Providence, pp. 173–194 (2010)
Madras, N., Pehlivan, L.: Structure of random 312-avoiding permutations. Random Struct. Algorithms (2015). doi:10.1002/rsa.20601
Marckert, J.-F., Mokkadem, A.: The depth first processes of Galton-Watson trees converge to the same Brownian excursion. Ann. Probab. 31(3), 1655–1678 (2003)
Miner, S., Pak, I.: The shape of random pattern-avoiding permutations. Adv. Appl. Math. 55, 86–130 (2014)
Mörters, P., Peres, Y.: Brownian motion. Cambridge University Press, Cambridge (2010)
Petrov, V.V.: Sums of independent random variables. Translated from the Russian by A. A. Brown, Ergebnisse der Mathematik und ihrer Grenzgebiete, Band 82. Springer, New York (1975)
Pitman, J., Rizzolo, D.: Schröder’s problems and scaling limits of random trees. Trans. Am. Math. Soc. 367(10), 6943–6969 (2015)
Acknowledgments
We would like to thank Lerna Pehlivan for many helpful suggestions. We would also like to thank Igor Pak for a helpful conversation.
Author information
Authors and Affiliations
Corresponding author
Additional information
Douglas Rizzolo: Supported by NSF Grant DMS-1204840.
Christopher Hoffman: Supported by NSF Grant DMS-1308645 and NSA Grant H98230-13-1-0827.
Erik Slivken: Supported by NSF RTG Grant 0838212.
Appendix A: Technical lemmas
Appendix A: Technical lemmas
We begin with a useful Lemma that will help count non-negative lattice paths between points. Let \({\mathcal {A}}_n\) denote the set of points \((i,m) \in {\mathbb {Z}} ^2\) such that \(0<n^{0.6}<i<2n^{0.9}\) and \(|m| < i^{0.55}.\)
Lemma 6.1
For \((i,m) \in {\mathcal {A}}_n.\)
where \(\Delta (i,m) = o(n^{-0.1})\) uniformly in i and m in \({\mathcal {A}}_n\).
For \(i> n^{0.6}\) and \(|m| > i^{0.55}\)
Proof
This first equality follows from \(\triangleright \) IX.1 on page 615 of Flajolet and Sedgewick [10]. For the second equality we let \(m = i^{0.55} + r\) or \(m = -i^{0.55} -r\) for some \(r>0.\) Using the first equality,
A similar computation holds for \(m = -i^{0.55} -r.\) \(\square \)
Consider a lattice path starting at \((v_0,h_0).\) Recall Definition 4.2. We may extend those definitions to general lattice paths with a slight modification. The definitions \(v_i\) and \(h_i\) remain the same, the position and the height after the ith up-step from the start of the path. For \(l_i\) we do not necessarily have an excursion. If the path never returns below \(h_i\) at some time later than \(v_i\) then we say that \(l_i = \infty .\)
Lemma 6.2
Suppose \((i,m)\in {\mathcal {A}}_n\) and \(h = h_0 + m.\) The number of lattice paths starting from \((v_0,h_0)\) ending with an ith up-step to \((v_i, h_0 + m)\) is given by
where \(\Delta (i,m)\) is as defined in Lemma 6.1.
Proof
Let i and d denote the number of up and down steps respectively in a lattice path starting at \(v_0\) ending with the ith up-step at position \(v_i\). We denote the total number of steps by \(v_i=v_0 + i+d\). The change in height for that path is given by \(h-h_0 = m= i-d\) so \(v_i = v_0+ 2i-m.\) The second to last position of the path is \((v_0 + 2i -m -1,h_0+m-1)\) since the last step is assumed to be an up-step. The total number of lattices paths from \((v_0,h_0)\) to \((v_0+2i-m-1,h_0 +m -1)\) is counted by Lemma 6.1, giving the equation found in Lemma 6.2 \(\square \)
Now that we can accurately count the number of lattice paths from one point to another we can count the number of non-negative paths between two points. For a pair of points \((v_0,h_0)\) and \((v_i,h_i)\) we let \({\mathcal {E}}_{v_0,h_0}^{v_i,h_i}\) denote the set of non-negative lattice paths ending with an up-step between the two points.
Lemma 6.3
For \((i,m) \in {\mathcal {A}}_n\), let \(h_0> n^{0.499},\) \(v_i = v_0 + 2i-m,\) and \(h_i = h_0+m.\) Then
where \(\Delta '(i,m)=o(n^{-0.1})\) uniformly in \(i,m \in A_n.\)
Proof
We count using standard ballot counting arguments. It is enough to consider only \(h_0 < i-m\) in the following approximations.
For \(h_0 >n^{0.499},\) if \(h_i>h_0\) then for \(m>0\)
If \(h_i < h_0\) then \(h_0 -|m| > h_0/2\) giving
Moreover \((h_0)^2/100i >n^{0.07},\) so by Lemma 6.2
\(\square \)
For paths chosen uniformly from \({\mathcal {E}}_{v_0,h_0}^{v_j,h_j}\) for \(0<i<j\) we would like to know for various values of i and h how many of these path go through the point \((v_i,h)\) after the ith up-step. Given \(\Gamma ^n \in {\mathcal {E}}_{v_0,h_0}^{v_j,h_j}\) chosen uniformly at random what is the probability that \(H^n_i = h?\)
Lemma 6.4
Fix \(v_0, h_0, v_j\) and \(h_j\). Let \(X^n\) be chosen uniformly from \({\mathcal {E}}_{v_0,h_0}^{v_j,h_j}\). For \(h>0 \) and \(0<i<j\),
Proof
Any path in \({\mathcal {E}}_{v_0,h_0}^{v_j,h_j}\) can be decomposed uniquely into a concatenation of two paths, one in \({\mathcal {E}}_{v_0,h_0}^{v_i,h_i}\) and the other in \({\mathcal {E}}_{v_i,h_i}^{v_j,h_j}\) for some appropriate values of \(v_i\) and \(h_i\) that satisfy \(v_i = v_0 + 2i - (h_i-h_0).\) If \(h_i = h,\) then \(v_i = v_0 + 2i-(h-h_0).\) The set \(\left\{ X^n \in {\mathcal {E}}_{v_0,h_0}^{v_j,h_j} | h_i=h\right\} \) is in bijection with \({\mathcal {E}}_{v_0,h_0}^{v_i,h} \times {\mathcal {E}}_{v_i,h}^{v_j,h_j}.\) Then
as desired (see Fig. 5). \(\square \)
Lemma 6.5
Fix \(v_0, h_0, v_j,\) with \(h_j\) such that \(v_j - v_0 =2j - (h_j-h_0)\) as above. Also fix \(i,h> 0\) and \(i < j-h.\) For \(X^n\) chosen uniformly from \({\mathcal {E}}_{v_0,h_0}^{v_j,h_j},\)
Proof
Let \(X^n \in {\mathcal {E}}_{v_0,h_0}^{v_j,h_j}\) also satisfy \(H^n_i = h\). From Lemma 6.4 there are precisely
such paths. Each of these paths that satisfies \(L^n_i/2 = h\) has a unique decomposition into three parts:
-
A path \(X^n_1 \in {\mathcal {E}}_{v_0,h_0}^{v_0 + 2i-(h-h_0),h}\),
-
an excursion \(X^n_2\) from \((v_0 + 2i-(h-h_0)_i,h)\) to \((v_ 0 + 2i-(h-h_0) + 2h-2,h)\), staying above \(h-1,\)
-
a single down-step from \((v_0 + 2i-(h-h_0)+2h-2,h)\) to \((v_0 + 2i-(h-h_0)+2h-1,h-1)\),
-
and a path \(X^n_3 \in {\mathcal {E}}_{v_0 + 2i-(h-h_0) + 2h-1,h-1}^{v_j,h_j}.\)
The choice of \(X^n_1, X^n_2, \) and \(X^n_3\) uniquely determines \(X^n.\) There are
such choices for \(X^n_1, X^n_2,\) and \(X^n_3\) respectively. Therefore
\(\square \)
Lemma 6.6
For \(X^n \in {\mathcal {E}}_{v_0,h_0}^{v_j,h_j}\) chosen uniformly at random and \(0<i<j,\)
Proof
If \(L^n_i/2 = H^n_i \) then there is some \(h \in {\mathbb {N}}\) such that \(\{ H^n_i = h\} \cap \{ L^n_i/2 = h\}\) occurs. Therefore
Luckily the event \(\{H^n_i = h \cap L^n_i/2 = h\}\) is disjoint from \(\{ H^n_i = h' \cap L^n_i/2 = h' \}\) for \(h\ne h'.\) Then
If \(h \notin ( \max (0,H^n_j - (j-i), h_0 + i)\) then \(\mathbb {P}( H^n_i = h) = 0.\) Otherwise we have
Combining Lemmas 6.4 and 6.5 provides the result. \(\square \)
Lemma 6.7
Let \(0<i<j\le 2n^{0.9}\) with \(i>2n^{0.6}\) and \(j-i > 2n^{0.6},\) and let \(h_0 \in (n^{0.499},n^{0.501})\). Define m and \(m_j\) such that \(h_j = h_0 + m_j \) and \(h = h_0 + m\) where \(|m_j|< \min (j^{0.55},n^{0.451}).\) Let \(m_{max} = \min ( i^{0.55}, m_j+(j-i)^{0.55} )\) and \(m_{min} = \max ( -i^{0.55}, m_j - (j-i)^{0.55}).\) For \(m_{min}<m<m_{max}\)
where \(\Delta =o(n^{-0.001} )\) uniformly in \(i,j,m,m_j,h_0\) that satisfy the above conditions.
For \(m <m_{min}\) or \(m>m_{max},\)
Proof
The summand in Lemma 6.6 is given by
By Lemma 6.3 we can make the following substitutions:
where both \(\Delta _1\) and \(\Delta _2\) are bounded uniformly by \(n^{-0.01}\) over all parameters satisfying the conditions of the lemma. Furthermore,
where \(\Delta _3\) is also uniformly bounded by \(n^{-0.01}\) over all parameters satisfying the conditions of the lemma. Combining these equations together proves the first statement of Lemma 6.7. For the second statement we use the second approximation in Lemma 6.1 to bound \(\mathbb {P}(H^n_i= h_0 + m)\) using the formula in Lemma 6.4. \(\square \)
Let’s consider the special case where \(j\approx n^{0.9}.\)
Lemma 6.8
For \(X^n\) chosen uniformly from \({\mathcal {E}}_{v_0,h_0}^{v_j,h_j}\) with \(i,j,h_0,\) and \(h_j\) satisfying
-
\(j = n^{0.9}(1+\Delta '), \Delta '\le n^{-0.1}\) uniformly.
-
\(n^{0.499}<h_0 < n^{0.501}.\)
-
\(i \in ( 2n^{0.6}, n^{0.9}-2n^{0.6}),\)
-
\(h_j = h_0 + m_j\) where \(|m_j| \le n^{0.451},\)
then
where \(\Delta = \Delta (i,h_0,h_j) = o(n^{-0.001})\) uniformly in \(i,h_0,h_j\) in the ranges above.
Proof
Let \(m_{min} = \max ( -i^{0.55}, m_j -(j-i)^{0.55} )\) and \(m_{max} = \min ( i^{0.55}, m_j+(j-i)^{0.55})\) and consider the inequality which follows from Lemma 6.6.
Lemma 6.7 gives
By our definition \((m_{min} - \frac{i}{j}m_j ) < -n^{0.01}\) and \((m_{max} - \frac{i}{j}m_j ) > n^{0.01}\). Therefore the integral above is computed in the standard way, with
where \(\delta (t)\) is an error function with exponential decay.
\(\square \)
Corollary 6.9
For any \(k \in {\mathbb {R}} \) and \(\alpha \in (0,.48)\) let \(\Gamma ^n\) chosen uniformly from \({\mathcal {E}}_{v_0,h_0}^{v_j,h_j}\) with \(i,j,h_0,\) and \(h_j\) satisfying
-
\(j = n^{0.9}(1+ \Delta '), \Delta ' < n^{-0.1}\) uniformly.
-
\(n^{0.499}<h_0 < n^{0.501}.\)
-
\(i \in ( 2n^{0.6}, n^{0.9}-2n^{0.6}),\)
-
\(h_j = h_0 + m_j\) where \(|m_j| \le n^{0.451},\)
then
where \(\Delta = \Delta (i,h_0,h_j) = o(n^{-0.001})\) uniformly in \(i,h_0,h_j\) in the ranges above.
Proof
The proof goes exactly as in Lemma 6.8 with \(L^n_i =H^n_i\) replaced by \(L^n_i =H^n_i - k(i(n-i)/n)^\alpha \). The order of \(k(i(n-i)/n)^\alpha \) is less than \(n^{0.49}\) so it will not affect the approximation. \(\square \)
Lemma 6.10
Fix \(0<a<b<1\) and let \(a_k = \lfloor an + nk/K\rfloor \) where \(K = \lfloor (b-a) n^{0.1} \rfloor .\) For \(\Gamma ^n \in \text {Dyck}^{2n}\) chosen uniformly at random,
Proof
This is an immediate consequence of Corollary 6.19 along with the convergence of Dyck paths to Brownian excursion. \(\square \)
Lemma 6.11
Fix \(0<a<b<1.\) For any n large enough and \(\Gamma ^n \in \text {Dyck}^{2n}\),
Proof
This follows by a similar argument to Corollaries 6.19 and 6.20, with slight modifications to the parameters. \(\square \)
Lemma 6.12
For sufficiently large n, for every \(\frac{1}{2}n^{0.9} < j\le 2n^{0.9},\) and \(h_0,h_j\) both bounded between \(n^{0.499}\) and \(n^{0.501}\) with \(|h_0-h_j| < n^{0.451}\) we have that if \(X^n \in {\mathcal {E}}_{v_0,h_0}^{v_{j},h_j}\) is chosen uniformly at random then
Proof
First note that the maximum fluctuation of \(|X^n(v_0 + tv_j) - h_0|\) is within 1 of the maximum fluctuation of \(|H^n_i- h_0|\) for \(i \le j\). Suppose \(i > j/2\), \(H^n_i=h\), and \(|h -h_0| > n^{0.452}\). Lemma 6.3 gives
for sufficiently large n, independent of \(j,h_0\), and \(h_j\) satisfying the hypotheses of the lemma. There are \(2(j-i)-(h_j-h)\) steps remaining to go from \((v_i,h)\) to \((v_j,h_j).\) So
Again by Lemma 6.3,
for sufficiently large n, independent of \(j,h_0\), and \(h_j\) satisfying the hypotheses of the lemma. Then we can conclude that
A similar bound can be used for \(i < j/2\) with a little more work. Note that if \(|h - h_0| > n^{0.452}\) and \(|h_j-h_0|<n^{0.451}\) then \(|h-h_j| > \frac{1}{2}n^{0.452}.\) The same argument now applies. Using the union bound and summing over the possible values of h and i now gives the result. \(\square \)
Lemma 6.13
Let \(I \subset [an,bn]\) denote an interval of length at most \(n^{\alpha }.\) For \(\gamma \in \text {Dyck}^{2n},\) if \(h_i > n^{0.49}\) for all \(i\in I\), then
Proof
If the jth excursion is contained in ith excursion, then both \(h_j > h_i\) and \(l_j/2 < l_i/2.\) If \(\theta _i=1\) then for \(i<j< l_i/2\), \(\theta _j=0.\)
For an interval I with \(|I|< n^{0.49}\) suppose at least one fixed point exists. Let \(i^*\) denote the first excursion that satisfies \(\theta _{i*}=1.\) Since \(i^*\) corresponds to a fixed point,
Therefore, for all \(j\in I\) such that \(j>i^*\) the jth excursion is contained in the \(i^*\)th excursion and \(\theta _j=0\). Therefore either \(\theta _{I}\) is either 0 or 1. For an interval of size greater than or equal to \(n^{\alpha }\), it can be covered by \(n^{\alpha -0.49}\) intervals of size \(n^{0.49}\) each of which has at most one fixed point so the total number of fixed points will be bounded by \(n^{\alpha -0.49}.\) \(\square \)
Corollary 6.14
Let \(I \subset [an,bn]\) denote an interval of length at most \(n^{\alpha }.\) For \(\gamma \in \text {Dyck}^{2n},\) if \(h_i > n^{0.49}\) for all \(i\in I\), then
Proof
The function \(f(i)=(i(n-i)/n)^{\alpha }\) can change by at most 1 over any interval of length \(n^{.49}\). This implies that over any interval \(I'\) of length \(n^{.49}\) has \(\theta ^{K,\alpha }_{I'}\le 2\). Then the result follows as in Lemma 6.13. \(\square \)
Lemma 6.15
There exists constant \(C>0\) such that or every n large enough and i, j, w that satisfy the following:
-
(a)
\(2n^{0.6}<i<j<n^{0.9}-2n^{0.6},\)
-
(b)
\(|i-j| > 2n^{0.6},\)
-
(c)
and \(w < n^{0.451}\)
$$\begin{aligned} \Psi (i,j,w,n)= & {} \sum _{m' = -\infty }^{\infty } \sum _{ m = -\infty }^{\infty } \exp \left( - \frac{1}{4} \left( \frac{m^2}{i} + \frac{(m-m')^2}{j-i} + \frac{(w-m')^2}{n^{0.9}-j} - \frac{w^2}{n^{0.9}} \right) \right) \\< & {} C \sqrt{ \frac{i (j-i) (n^{0.9} - j) }{n^{0.9}}}. \end{aligned}$$
Proof
Our goal will be to convert this double sum into a recognizable form.
where
With some algebra we see
for some positive constant \(C_1\) that does not depend on i, j or \(m'\). Inserting this into the upper bound for \(\Psi (i,j,w,n)\) gives
where \(C>0\) and does not depend on i, j, w, and n. \(\square \)
The next two results are special cases of [24, Theorem III.12, Theorem III.15] respectively (see also [21, Lemma A1, Lemma A2]).
Lemma 6.16
Let \(X_1,X_2,\dots \) be i.i.d with \({\mathbb {E}}X_1=0\) and let \(S_n =X_1+\cdots + X_n\). Suppose that \(\sigma ^2= {\mathbb {E}}(X_1^2) < \infty \). For all x and n we have
Lemma 6.17
Let \(X_1,X_2,\dots \) be i.i.d with \({\mathbb {E}}X_1=0\) and let \(S_n =X_1+\cdots + X_n\). Suppose that there exists \(a>0\) such that \({\mathbb {E}}(e^{t |X_1|}) < \infty \). Then there exist constants \(g, T>0\), independent of n, such that
These lemmas lead immediately to the following corollary.
Corollary 6.18
Maintaining the hypotheses of Lemma 6.17, fix \(\epsilon , c>0\) and \(0< \alpha < 2\beta \) and let \(\nu = \min (\beta , 2\beta -\alpha )\). There exist constants \(A,B >0\) such that
Let \(S=(S_m,m\ge 0)\) be a simple symmetric random walk on \({\mathbb {Z}} \) with \(S_0=0\). Define \(V_0=0\) and for \(m\ge 1\) let \(V_m = \inf \{k>V_{m-1} : S_k-S_{k-1} = 1\}\). Let \(\eta (S) = \inf \{ k : S_k=-1\}\). Observe that \((V_m-V_{m-1})_{m\ge 1}\) is an i.i.d sequence of geometric random variables with parameter 1 / 2.
Corollary 6.19
Fix \(\epsilon >0\) and \(1/2 < \alpha \le 1\). There exist constants \(A, B>0\) such that
Corollary 6.20
Let \(\Gamma ^n\) be a uniformly random Dyck path of length 2n. For any \(\delta >0\), there exist constants \(A,B,\nu >0\) such that for all \(n\ge 1\)
and
Proof
Noting that
the first claim is an immediate consequence of Lemmas 6.16 and 6.17 combined with the fact that \({\mathbb {P}}(\eta (S) =2n+1) \sim cn^{-3/2}\) for some \(c>0\). The second claim follows similarly from Corollary 6.18. \(\square \)
Rights and permissions
About this article
Cite this article
Hoffman, C., Rizzolo, D. & Slivken, E. Pattern-avoiding permutations and Brownian excursion, part II: fixed points. Probab. Theory Relat. Fields 169, 377–424 (2017). https://doi.org/10.1007/s00440-016-0732-2
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00440-016-0732-2