Enumerative conjecture for minimally-sorted permutations
Statement
Let be the set of minimally-sorted permutations under . Enumerative conjecture. For every positive integer ,
This gives a recurrence between the numbers of minimally-sorted permutations of consecutive odd and even lengths; the source says it was computationally verified for .
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.