Permutations Containing Many Patterns
It is shown that the maximum number of patterns that can occur in a permutation of length $n$ is asymptotically $2^n$. This significantly improves a previous result of Coleman.
math.CO↗
arXiv subjects
Micah Coleman
Publications and source records attributed to Micah Coleman.
An (almost) optimal answer to a question by Wilf
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.
math.CO↗