ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let kk be a positive integer and set n=(k−1)3n=(k-1)^3. Write obreakSav⁡n(12⋯k) obreak\operatorname{Sav}_n(12\cdots k) for the set of permutations of length nn whose square strongly avoids the increasing pattern 12⋯k12\cdots k.

Sharpness conjecture.

Sav⁡n(12⋯k)≠∅.\operatorname{Sav}_n(12\cdots k)\neq\varnothing.

The conjecture asserts that the upper bound n≤(k−1)3n\leq (k-1)^3 from the monotone-pattern theorem is always attained. Constructions are given for small values of kk, including k=3,4,5,6k=3,4,5,6, but the general case remains open.

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.