Non-equivalence conjecture for four length-four patterns
Statement
Let denote the set of permutations of length with the specified descent-type parameter that avoid the pattern . Non-equivalence conjecture. For each and every with ,
This concerns patterns that do not appear to be Wilf-equivalent to any other pattern for any descent type; the source presents it as a conjecture based on the preceding empirical discussion.
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.