The expected number of distinct consecutive patterns in a random permutation
Abstract
Let πn be a uniformly chosen random permutation on [n]. Using an analysis of the probability that two overlapping consecutive k-permutations are order isomorphic, we show that the expected number of distinct consecutive patterns of all lengths k ∈ {1, 2,…, n} in πn is
© 2023 Austin Allen, Dylan Cruz Fonseca, Veronica Dobbs, Egypt Downs, Evelyn Fokuoh, Anant Godbole, Sebastián Papanikolaou Costa, Christopher Soto, Lino Yoshikawa, published by Corvinus University of Budapest
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.