ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let m≥1m\geq 1 and let σ∈Sm\sigma\in\mathcal{S}_m be a consecutive pattern. Define

ρσ=lim⁡n→∞(αn(σ)n!)1/n,\rho_{\sigma}=\lim_{n\to\infty}\left(\frac{\alpha_n(\sigma)}{n!}\right)^{1/n},

where αn(σ)\alpha_n(\sigma) is the number of permutations in Sn\mathcal{S}_n avoiding σ\sigma as a consecutive pattern. A pattern is monotone if it is either (12…m)(12\dots m) or (m…21)(m\dots21). The consecutive monotone pattern conjecture. For any σ∈Sm\sigma\in\mathcal{S}_m,

ρσ≤ρ(12…m).\rho_{\sigma}\leq\rho_{(12\dots m)}.

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 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.