Determining lower bounds for packing densities of non-layered patterns using weighted templates

MaRDI QIDQ1010765zbMATH OpenFDO

Authors Cathleen Battiste Presutti

Publication date 7 April 2009

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/117236, http://www.emis.de/journals/EJC/Volume_15/Abstracts/v15i1r50.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

lower boundnon-layered patternspacking density

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Asymptotic enumeration (05A16)

Review text

Summary: The packing density of a permutation pattern \(\pi\) is the limiting value, \({n}\rightarrow\infty\), of the maximum proportion of subsequences of \(\sigma\in{S_{n}}\) that are order-isomorphic to \(\pi\). We generalize methods for obtaining lower bounds for the packing density of any pattern and demonstrate the methods' usefulness when patterns are non-layered.

Recommendations

• On packing densities of permutations
• Packing patterns into words
• Packing densities of patterns
• Bounding quantities related to the packing density of 1(+1) 2
• Colored patterns and their packing densities

Cited in

(3)

• Independence of permutation limits at infinitely many scales
• Density maximizers of layered permutations
• Minimum Number of Monotone Subsequences of Length 4 in Permutations

This page was built for publication: Determining lower bounds for packing densities of non-layered patterns using weighted templates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010765)