Mountain-end anchored packing conjecture
Statement
Consider a mountain permutation on the points, and suppose it starts with and ends with for some . Let be the proportion of the rectangular region with opposite vertices and that can be filled, where . Mountain-end conjecture. Under these assumptions, one can fill at least
of the entire square. This claim is proposed as a strengthening for mountain permutations and would imply the lower bound 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.