Conjecture that Wilf equivalence implies enumerating equivalence for binary-tree patterns
Statement
Let and be patterns on binary trees. Two patterns are Wilf equivalent when their avoidance functions are equal, and they are enumerating equivalent when their enumerating generating functions are equal. The avoidance function of a pattern is , while its enumerating generating function is , where counts binary trees avoiding and counts those containing exactly copies of . Wilf-to-enumerating equivalence conjecture. If two patterns and are Wilf equivalent, then they are enumerating equivalent. Since , enumerating equivalence is a stronger condition than Wilf equivalence; the conjecture asserts that these two notions nevertheless coincide for such patterns.
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.