The packing density of other layered permutations

MaRDI QIDQ1856063zbMATH OpenFDO

Authors Peter Hästö

Publication date 13 May 2003

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

Full work available at URL http://www.emis.de/journals/EJC/Volume_9/Abstracts/v9i2r1.html

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

Mathematics Subject Classification ID

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

Review text

The author computes the packing density of several layered permutations. In particular, the packing density for layered permutations of type \([m_1,\dots,m_r]\) with \(\log(r+1)\leq\min\{m_i\}\) is derived.

Cited in

(8)

• Packing sets of patterns
• Density maximizers of layered permutations
• Dense packing of patterns in a permutation
• Packing densities of more 2-block patterns
• Patterns in random permutations
• Packing patterns in symmetric words
• A note on permutation regularity
• Bounding quantities related to the packing density of 1(+1) 2

This page was built for publication: The packing density of other layered permutations

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