Packing densities of patterns
type: Item
instance of: scholarly article
title: Packing densities of patterns
zbMATH Open document ID: 1061.05007
author: Reid W. Barton
published in: The Electronic Journal of Combinatorics
publication date: 2005-04-25T00:00:00Z
full work available at URL: https://eudml.org/doc/124544
full work available at URL: v11i1r80.html
review text: Summary: The packing density of a permutation \(\pi\) of length \(n\) is the maximum proportion of subsequences of length \(n\) which are order-isomorphic to \(\pi\) in arbitrarily long permutations \(\sigma\). For the generalization to patterns \(\pi\) which may have repeated letters, two notions of packing density have been defined. In this paper, we show that these two definitions are equivalent, and we compute the packing density for new classes of patterns.
Mathematics Subject Classification ID: 05A15
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 05A16
zbMATH DE Number: 2161283
zbMATH Keywords: packing density
zbMATH Keywords: permutation
zbMATH Keywords: patterns
zbMATH Keywords: word
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 2161283