An (almost) optimal answer to a question by Wilf
Combinatorics
2007-05-23 v1
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.
Cite
@article{arxiv.math/0404181,
title = {An (almost) optimal answer to a question by Wilf},
author = {Micah Coleman},
journal= {arXiv preprint arXiv:math/0404181},
year = {2007}
}