Author:
Albert M. H.,Atkinson M. D.,Handley C. C.,Holton D. A.,Stromquist W.
Abstract
The density of a permutation pattern $\pi$ in a permutation $\sigma$ is the proportion of subsequences of $\sigma$ of length $|\pi|$ that are isomorphic to $\pi$. The maximal value of the density is found for several patterns $\pi$, and asymptotic upper and lower bounds for the maximal density are found in several other cases. The results are generalised to sets of patterns and the maximum density is found for all sets of length $3$ patterns.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献