An Answer to a Question by Wilf on Packing Distinct Patterns in a Permutation

  • Micah Coleman

Abstract

We present a class of permutations for which the number of distinctly ordered subsequences of each permutation approaches an almost optimal value as the length of the permutation grows to infinity.

Published
2004-05-24
How to Cite
Coleman, M. (2004). An Answer to a Question by Wilf on Packing Distinct Patterns in a Permutation. The Electronic Journal of Combinatorics, 11(1), N8. https://doi.org/10.37236/1849
Article Number
N8