The split-permutation conjecture for largest MVP fibre size

For n1n\geq 1, let OMVPn\mathcal{O}_{\mathrm{MVP}_{n}} denote the MVP outcome map on permutations of size nn, and let split2,n2:=(n1)n(n2)(n3)21\mathrm{split}^{2,n-2}:=(n-1)n(n-2)(n-3)\cdots21 for n3n\geq3. The MVP split-permutation conjecture. For n6n\geq6, the permutation with the largest MVP fibre size is the split permutation split2,n2\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.

Sources & referencesView supporting material

Primary source

Thomas Selig and Haoyue Zhu, “New combinatorial perspectives on MVP parking functions and their outcome map”, arXiv:2309.11788 (2023).

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.