An answer to a question by Wilf on packing distinct patterns in a permutation
The electronic journal of combinatorics, Tome 11 (2004) no. 1
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.
@article{10_37236_1849,
author = {Micah Coleman},
title = {An answer to a question by {Wilf} on packing distinct patterns in a permutation},
journal = {The electronic journal of combinatorics},
year = {2004},
volume = {11},
number = {1},
doi = {10.37236/1849},
zbl = {1053.05002},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1849/}
}
Micah Coleman. An answer to a question by Wilf on packing distinct patterns in a permutation. The electronic journal of combinatorics, Tome 11 (2004) no. 1. doi: 10.37236/1849
Cité par Sources :