ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let SnS_n denote the set of permutations of [n]={1,2,…,n}[n]=\{1,2,\ldots,n\}, and let Sn(τ)S_n(\tau) be the set of permutations avoiding a pattern τ∈Sℓ\tau\in S_\ell. Stanley–Wilf conjecture. For any pattern τ∈Sℓ\tau\in S_\ell, the limit

lim⁡n→∞∣Sn(τ)∣1n\lim_{n\rightarrow\infty}|S_n(\tau)|^{\frac{1}{n}}

exists and is finite. This conjecture concerns the exponential growth rate of permutation classes defined by pattern avoidance; the supplied text does not state whether it has been resolved.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.