Geodesic
Packing densities of patterns
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

The packing density of a permutation $\pi$ of length $n$ is the maximum proportion of subsequences of length $n$ which are order-isomorphic to $\pi$ in arbitrarily long permutations $\sigma$. For the generalization to patterns $\pi$ which may have repeated letters, two notions of packing density have been defined. In this paper, we show that these two definitions are equivalent, and we compute the packing density for new classes of patterns.
DOI : 10.37236/1833
Classification : 05A15, 05A05, 05A16
Mots-clés : packing density, permutation, patterns, word 
@article{10_37236_1833,
     author = {Reid W. Barton},
     title = {Packing densities of patterns},
     journal = {The electronic journal of combinatorics},
     year = {2004},
     volume = {11},
     number = {1},
     doi = {10.37236/1833},
     zbl = {1061.05007},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1833/}
}
TY  - JOUR
AU  - Reid W. Barton
TI  - Packing densities of patterns
JO  - The electronic journal of combinatorics
PY  - 2004
VL  - 11
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1833/
DO  - 10.37236/1833
ID  - 10_37236_1833
ER  - 
%0 Journal Article
%A Reid W. Barton
%T Packing densities of patterns
%J The electronic journal of combinatorics
%D 2004
%V 11
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/1833/
%R 10.37236/1833
%F 10_37236_1833
Reid W. Barton. Packing densities of patterns. The electronic journal of combinatorics, Tome 11 (2004) no. 1. doi: 10.37236/1833

Cité par Sources :