3 problems
- 0 votes0 replies1 view
Conway–Guttman asymptotics conjecture for occurrences of length-four patterns
Conway–Guttman conjecture. For , there is a constant such that
- 0 votes0 replies0 views
Conjecture on the computed Wilf and enumeration classes of one-relator operads
For , let be the number of Wilf classes and let be the number of enumeration classes of one-relator binary operads with a relation of degree . The…
- 0 votes0 replies0 views
Conjecture that Wilf equivalence implies enumerating equivalence for binary-tree patterns
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 g…