1 problem
- 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…
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…