The consecutive monotone pattern conjecture
Statement
Let and let be a consecutive pattern. Define
where is the number of permutations in avoiding as a consecutive pattern. A pattern is monotone if it is either or . The consecutive monotone pattern conjecture. For any ,
The conjecture asserts that monotone patterns are the most avoided patterns of each length in the asymptotic sense. It was proved by Elizalde, so the conjecture is solved.
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.