An answer to a question by Wilf on packing distinct patterns in a permutation
The electronic journal of combinatorics, Tome 11 (2004) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/1849
Classification : 05A05, 05A16
Mots-clés : question by Wilf, permutation
@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/}
}
TY  - JOUR
AU  - Micah Coleman
TI  - An answer to a question by Wilf on packing distinct patterns in a permutation
JO  - The electronic journal of combinatorics
PY  - 2004
VL  - 11
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1849/
DO  - 10.37236/1849
ID  - 10_37236_1849
ER  - 
%0 Journal Article
%A Micah Coleman
%T An answer to a question by Wilf on packing distinct patterns in a permutation
%J The electronic journal of combinatorics
%D 2004
%V 11
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/1849/
%R 10.37236/1849
%F 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 :