Three-run enumeration conjecture for flattened Stirling permutations
Statement
Let denote the set of Stirling permutations of order , and let be the set of those with exactly three runs. Three-run enumeration conjecture. The number of Stirling permutations of order with exactly three runs is
This was computationally verified for , but a proof is not supplied.
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.