Determining lower bounds for packing densities of non-layered patterns using weighted templates (Q1010765)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5540955
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Determining lower bounds for packing densities of non-layered patterns using weighted templates |
scientific article; zbMATH DE number 5540955 |
Statements
Determining lower bounds for packing densities of non-layered patterns using weighted templates (English)
0 references
7 April 2009
0 references
Summary: 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.
0 references
packing density
0 references
lower bound
0 references
non-layered patterns
0 references
0.8181411027908325
0 references
0.8161243796348572
0 references
0.8074833154678345
0 references
0.7908127307891846
0 references
0.7878396511077881
0 references
