Determining lower bounds for packing densities of non-layered patterns using weighted templates
The electronic journal of combinatorics, Tome 15 (2008)
The packing density of a permutation pattern $\pi$ is the limiting value, ${n}$ $\rightarrow$ $\infty$, of the maximum proportion of subsequences of $\sigma$ $\in$ ${S_{n}}$ that are order-isomorphic to $\pi$. We generalize methods for obtaining lower bounds for the packing density of any pattern and demonstrate the methods' usefulness when patterns are non-layered.
DOI :
10.37236/774
Classification :
05A16, 05A05
Mots-clés : packing density, lower bound, non-layered patterns
Mots-clés : packing density, lower bound, non-layered patterns
@article{10_37236_774,
author = {Cathleen Battiste Presutti},
title = {Determining lower bounds for packing densities of non-layered patterns using weighted templates},
journal = {The electronic journal of combinatorics},
year = {2008},
volume = {15},
doi = {10.37236/774},
zbl = {1179.05013},
url = {http://geodesic.mathdoc.fr/articles/10.37236/774/}
}
TY - JOUR AU - Cathleen Battiste Presutti TI - Determining lower bounds for packing densities of non-layered patterns using weighted templates JO - The electronic journal of combinatorics PY - 2008 VL - 15 UR - http://geodesic.mathdoc.fr/articles/10.37236/774/ DO - 10.37236/774 ID - 10_37236_774 ER -
Cathleen Battiste Presutti. Determining lower bounds for packing densities of non-layered patterns using weighted templates. The electronic journal of combinatorics, Tome 15 (2008). doi: 10.37236/774
Cité par Sources :