Packing sets of patterns

Authors:
Alexander Burstein;Peter Hästö
Affiliations:
Department of Mathematics, Howard University, Washington, DC 20059, USA;Department of Mathematical Sciences, P.O. Box 3000, 90014 University of Oulu, Finland
Venue:
European Journal of Combinatorics
Year:
2010

Citing 3
Cited 0

A condensed condensation proof of a determinant evaluation conjectured by Greg Kuperberg and Jim Propp

Journal of Combinatorial Theory Series A
Sorting Using Networks of Queues and Stacks

Journal of the ACM (JACM)
Pattern frequency sequences and internal zeros

Advances in Applied Mathematics - Special issue: Memory of Rodica Simon

Quantified Score

Hi-index	0.01

Visualization

Abstract

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 article focusing exclusively on it. We find the packing density for various special sets of permutations and study permutation and pattern co-occurrence.