ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Consider a mountain permutation on the points, and suppose it starts with mm and ends with (m−1,m−2,…,1)(m-1,m-2,\ldots,1) for some m≤nm\leq n. Let kk be the proportion of the rectangular region with opposite vertices P1P_1 and (xn−m+1,1)(x_{n-m+1},1) that can be filled, where k>12k>\frac12. Mountain-end conjecture. Under these assumptions, one can fill at least

12+12(m+12k−1)\frac{1}{2}+\frac{1}{2\left(m+\frac{1}{2k-1}\right)}

of the entire square. This claim is proposed as a strengthening for mountain permutations and would imply the lower bound 12+12n\frac12+\frac{1}{2n} for their optimal area; the source proves only the weaker half-area bound for mountain permutations.

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.