2 problems
- 0 votes0 replies0 views
Two-virtual-crossing single-component reduction conjecture
Single-component reduction conjecture. Any single-component diagram decorated with no more than two distinct virtual crossings reduces by detour moves to a circle.
- 0 votes0 replies0 views
Two-virtual-crossing single-loop reduction conjecture
Single-loop reduction conjecture. A single-loop state with exactly two distinct virtual crossings can be undone by virtual moves.