Increasing-pattern extremal conjecture for distant-pattern avoidance

At least 5 years old · documented by

Let m≥3m\geq3 and r≥1r\geq1, and let qq be any classical pattern of size mm. Increasing-pattern extremal conjecture. There exists n0∈Nn_0\in\mathbb{N} such that for every natural number n>n0n>n_0,

∣Av⁡n(dist⁡r(12⋯m))∣≥∣Av⁡n(dist⁡r(q))∣.|\operatorname{Av}_{n}(\operatorname{dist}_{r}(12\cdots m))|\geq|\operatorname{Av}_{n}(\operatorname{dist}_{r}(q))|.

Thus, among classical patterns of size mm, the increasing pattern is conjectured to have asymptotically largest distant-pattern avoidance classes for each fixed gap size rr. The claim is listed among the paper's open problems and is unresolved in the supplied source.

References

Primary source

Stoyan Dimitrov, “On permutation patterns with constrained gap sizes”, arXiv:2002.12322 (2021).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.