1 problem

0 votes0 replies0 views
Universal success conjecture for the reduced simplification procedure
Universal success conjecture. The procedure ${\mathcal P}$ successfully simplifies every link diagram.
Conjectureopendiagram-simplification knot-diagrams knot-theoryarXiv posted 2 days ago

Universal success conjecture for the reduced simplification procedure