Search: onr:"swepub:oai:DiVA.org:kth-17208" >
Dense packing of pa...
Dense packing of patterns in a permutation
-
- Eriksson, Henrik (author)
- KTH,Numerisk Analys och Datalogi, NADA,NADA, KTH, Stockholm SE-100 44, Sweden
-
- Eriksson, Kimmo (author)
- Mälardalens högskola,Institutionen för matematik och fysik,IMA, Mälardalens Högskola, Västerås SE-721 23, Sweden
-
- Linusson, Svante (author)
- KTH,Matematik (Avd.),Department of Mathematics, KTH, Stockholm SE-100 44, Sweden
-
show more...
-
- Wästlund, Johan (author)
- Linköpings universitet,Tekniska högskolan,Tillämpad matematik
-
show less...
-
(creator_code:org_t)
- 2008-04-26
- 2007
- English.
-
In: Annals of Combinatorics. - : Springer Science and Business Media LLC. - 0218-0006 .- 0219-3094. ; 11:3-4, s. 459-470
- Related links:
-
https://urn.kb.se/re...
-
show more...
-
https://doi.org/10.1...
-
https://urn.kb.se/re...
-
https://urn.kb.se/re...
-
show less...
Abstract
Subject headings
Close
- We study the length L-k of the shortest permutation containing all patterns of length k. We establish the bounds e(-2)k(2) < L-k <= (2/3 + o(1))k(2). We also prove that as k there are permutations of length (1/4+o(1))k(2) containing almost all patterns of length k.
Subject headings
- NATURVETENSKAP -- Matematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics (hsv//eng)
Keyword
- pattern containment
- permutation statistic
- MATHEMATICS
- MATEMATIK
- TECHNOLOGY
Publication and Content Type
- ref (subject category)
- art (subject category)
Find in a library
To the university's database