Can I read Pattern avoidance is not P-recursive on EtoBox?

Pattern avoidance is not P-recursive by Garrabrant, Scott; Pak, Igor is a scholarly article available to read on EtoBox.

What is Pattern avoidance is not P-recursive about?

Let $F \subset S_k$ be a finite set of permutations and let $C_n(F)$ denote the number of permutations $\sigma$ in $S_n$ avoiding the set of patterns $F$. The Noonan-Zeilberger conjecture states that the sequence ${C_n(F)}$ is P-recursive. We use Computability Theory to disprove this conjecture.

Author

Garrabrant, Scott; Pak, Igor

Published

2015

Language

EN