Abstract
Let F ⊂ Sk be a finite set of permutations and let Cn(F) denote the number of permutations σ σ Sn avoiding the set of patterns F. We prove that {Cn(F)} cannot be computed in time polynomial in n, unless EXP = ⊕EXP. Our tools also allow us to disprove the Noonan-Zeilberger conjecture which states that the sequence {Cn(F)} is P-recursive.
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for freeCite
CITATION STYLE
APA
Garrabrant, S., & Pak, I. (2016). Permutation patterns are hard to count. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 2, pp. 923–936). Association for Computing Machinery. https://doi.org/10.1137/1.9781611974331.ch66
Readers' Seniority
Readers' Discipline
