3 problems

Let $g_{n,k}$ denote the number of curve diagrams of genus $n$ and complexity $k$, as in the paper. Let $n\geq 2$ be an integer. Periodic-limit conjecture. There exists a positive…

Let $g_{n,k}$ denote the number of curve diagrams of genus $n$ and complexity $k$, as in the paper. Let $n\geq 2$ be an integer. Polynomial-growth conjecture. There exist positive…

Tangledness-reduction conjecture. The product $\beta\beta_+$ has smaller $\tau$-length than $\beta$.