A Central Limit Theorem for Repeating Patterns
From MaRDI portal
Publication:6232301
arXiv1204.2872MaRDI QIDQ6232301FDOQ6232301
Authors: Aaron Abrams, Eric Babson, Henry Landau, Zeph A. Landau, James Pommersheim 
Publication date: 12 April 2012
Abstract: This note gives a central limit theorem for the length of the longest subsequence of a random permutation which follows some repeating pattern. This includes the case of any fixed pattern of ups and downs which has at least one of each, such as the alternating case considered by Stanley in [2] and Widom in [3]. In every case considered the convergence in the limit of long permutations is to normal with mean and variance linear in the length of the permutations.
This page was built for publication: A Central Limit Theorem for Repeating Patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6232301)
