On the Best Upper Bound for Permutations Avoiding A Pattern of a Given Length
From MaRDI portal
Publication:6235593
arXiv1209.2404MaRDI QIDQ6235593FDOQ6235593
Authors: Miklós Bóna 
Publication date: 11 September 2012
Abstract: Numerical evidence suggests that certain permutation patterns of length k are easier to avoid than any other patterns of that same length. We prove that these patterns are avoided by no more than (2.25k^2)^n permutations of length n. In light of this, we conjecture that no pattern of length k is avoided by more than that many permutations of length n.
This page was built for publication: On the Best Upper Bound for Permutations Avoiding A Pattern of a Given Length
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6235593)
