OpenAlex
On the Number of Unknot Diagrams
Work
Year: 2019
Type: article
Abstract: Let $D$ be a knot diagram, and let ${\mathcal D}$ denote the set of diagrams that can be obtained from $D$ by crossing exchanges. If $D$ has $n$ crossings, then ${\mathcal D}$ consists of $2^n$ diagra... more
Cites: 20
Cited by: 4
Related to: 10
FWCI: 0.773
Citation percentile (by year/subfield): 59.6
Open Access status: green
Grant IDS 222667,