2 problems

Let $m$ be an integer and let $\hat{\mathcal{D}}$ be the $0$-crossing diagram of the unknot. A diagram of the unknot $\mathcal{D}$ has $n$ crossings if…

Let the Freedman–He–Wang unknot be the unknot diagram discussed in the cited source, and let an unknotting sequence be a sequence of Reidemeister moves connecting it to a round dia…