Packing densities of layered permutations and the minimum number of monotone sequences in layered permutations
In this paper, we present two new results of layered permutation densities. The first one generalizes theorems from H\"{a}st\"{o} (2003) and Warren (2004) to compute the permutation packing of permutations whose layer sequence is~$(1^a,\ell_1,\ell_2,\ldots,\ell_k)$ with~$2^a-a-1\geq k$ (and similar...
שמור ב:
| Principais autores: | , |
|---|---|
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
Discrete Mathematics & Theoretical Computer Science
2016-06-01
|
| סדרה: | Discrete Mathematics & Theoretical Computer Science |
| נושאים: | |
| גישה מקוונת: | https://dmtcs.episciences.org/1313/pdf |
| תגים: |
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|