ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For n≥1n\geq 1, let OMVPn\mathcal{O}_{\mathrm{MVP}_{n}} denote the MVP outcome map on permutations of size nn, and let split2,n−2:=(n−1)n(n−2)(n−3)⋯21\mathrm{split}^{2,n-2}:=(n-1)n(n-2)(n-3)\cdots21 for n≥3n\geq3. The MVP split-permutation conjecture. For n≥6n\geq6, the permutation with the largest MVP fibre size is the split permutation split2,n−2\mathrm{split}^{2,n-2}. Numerical evidence supports the claim for n=7,8,9,10,11n=7,8,9,10,11, although the conjecture is not established in the supplied text.

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.