ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let an nn-permutation be a permutation of the entries 1,2,…,n1,2,\ldots,n, and let a block transposition interchange two adjacent blocks of entries. A series of such operations sorts a permutation if it transforms it into the increasing permutation 12⋯n12\cdots n.

Wastlund's conjecture. If n≠13n\neq 13 and n≠15n\neq 15, then every nn-permutation can be sorted by at most

⌈(n+1)/2⌉\lceil (n+1)/2 \rceil

block transpositions.

The conjecture proposes a sharp upper bound matching the known lower bound for the decreasing permutation n(n−1)⋯21n(n-1)\cdots 21. The supplied text gives no resolution status for the conjecture.

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.