Growth conjecture for simple permutations in the avoidance class
Statement
Let denote the number of simple permutations of length in the class described above.
Growth conjecture. For ,
If true, this would improve the lower bound on the exponential growth rate of the numbers by providing stronger lower bounds for the number of simple 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.