4 problems
- 0 votes0 replies1 view
Universal nonreduction conjecture for the family
nonreduction conjecture. No environment of this type will fully reduce all of the configurations .
- 0 votes0 replies1 view
Universal persistence conjecture for complexified knots
Complexified-knot persistence conjecture. The phenomenon observed in the examples is qualitatively the same in any force-field environment for knot repulsion.
- 0 votes0 replies0 views
Universal force-field conjecture for hard unknots
Hard-unknot force-field conjecture. Some unknots of the form will not be able to evolve to simple circles in any force field of this kind.
- 0 votes0 replies0 views
Self-repulsion conjecture for hard unknots
Hard-unknot conjecture. Any algorithm based only on self-repulsion will be unable to unknot for some natural-number value of . More generally, sufficiently complex unknots…