1 problem

Let $n \geq 4$. A path tree is the path-tree object used in the paper, and a parse word is a word that parses a binary tree. Double-zero parse-word conjecture. Every pair of $n$-le…