Stanley–Wilf conjecture for permutation pattern avoidance
Statement
Let denote the set of permutations of , and let be the set of permutations avoiding a pattern . Stanley–Wilf conjecture. For any pattern , the limit
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.