3 problems
Conway–Guttman conjecture. For , there is a constant such that
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…
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…