3 problems
- 0 votes0 replies0 views
Finiteness conjecture for non-simplifiable rectangular diagrams
Let be a link type in . A rectangular diagram representing is non-simplifiable if it cannot be reduced by the simplifying moves considered fo…
- 0 votes0 replies0 views
Finiteness conjecture for non-destabilizable Legendrian link types
Let be a link type in . A Legendrian link type is non-destabilizable if it cannot be obtained from another Legendrian link type by a destabilization. Fini…
- 0 votes0 replies0 views
The 21n diagrams have the proposed resultant classification
A free knot is the free knot diagram formed from the -tangle and a free -tangle, as used in the source. Resultants are knots obtained by assigning all free crossings.…