Non-overlapping permutation patterns

We show a way to compute, to a high level of precision, the probability that a randomly selected permutation of length n is non-overlapping. As a byproduct, we nd some combinatorial identities that are routine to prove using generating functions, but di cult to prove bijectively. Mathematics Subject Classi cation(2010). 05A16, 05A05, 05A10.

[1]  N. J. A. Sloane,et al.  The On-Line Encyclopedia of Integer Sequences , 2003, Electron. J. Comb..

[2]  Steven R. Finch,et al.  Mathematical constants , 2005, Encyclopedia of mathematics and its applications.

[3]  Jeffrey B. Remmel,et al.  Minimal Overlapping Patterns in Colored Permutations , 2011, Electron. J. Comb..

[4]  A Bijective Proof of and Identity Extending a Classic Result of Hajos , 2012, 1203.3264.

[5]  Marc Noy,et al.  Consecutive patterns in permutations , 2003, Adv. Appl. Math..