1 problem
Let be a link type in . A rectangular diagram representing is non-simplifiable if it cannot be reduced by the simplifying moves considered fo…
Let be a link type in . A rectangular diagram representing is non-simplifiable if it cannot be reduced by the simplifying moves considered fo…