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

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.

• Type: Journal
• Year: 2004
• Where: COMBINATORICS
• Authors: Micah Coleman
• Keywords: COMBINATORICS 2004, Optimal Value, Permutation