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

zbMATH Open1179.05013MaRDI QIDQ1010765FDOQ1010765

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

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

Recommendations

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

zbMATH Keywords

lower boundpacking densitynon-layered patterns

Mathematics Subject Classification ID

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

Cited In (3)

• Independence of permutation limits at infinitely many scales
• Minimum Number of Monotone Subsequences of Length 4 in Permutations
• Density maximizers of layered 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)