arXiv Analytics

Sign in

arXiv:math/0409244 [math.CO]AbstractReferencesReviewsResources

Packing sets of patterns

Alexander Burstein, Peter Hästö

Published 2004-09-15Version 1

Packing density is a permutation occurrence statistic which describes the maximal number of permutations of a given type that can occur in another permutation. In this article we focus on containment of sets of permutations. Although this question has been tangentially considered previously, this is the first systematic study of it. We find the packing density for various special sets of permutations and study permutation and pattern co-occurrence.

Related articles: Most relevant | Search more
arXiv:1301.1303 [math.CO] (Published 2013-01-07, updated 2015-04-09)
On Packing Densities of Set Partitions
arXiv:math/0405512 [math.CO] (Published 2004-05-26)
Bounding quantities related to the packing density of 1(L+1)L...2
arXiv:1510.07312 [math.CO] (Published 2015-10-25)
Packing densities of layered permutations and the minimum number of monotone sequences in layered permutations