←back to thread

141 points baruchel | 1 comments | | HN request time: 0.356s | source
Show context
viraptor ◴[] No.45124051[source]
Is this something people have been actively trying to disprove? The example provided seems to not be hard to bruteforce - given it's only 5 moves. Does anyone know why there's no older counter example? (Or am I totally underestimating how the number of options explodes in 5 moves?)
replies(3): >>45124262 #>>45124346 #>>45129087 #
1. adgjlsfhk1 ◴[] No.45124262[source]
I think this is a combination of things.

1: knot theory is somewhat obscure. it generally only comes up in undergrad in a topology class for a week or two so there aren't a ton of people interested

2. It's 5 cuts on a joining of 2 knots with 6 crossings. it's brute forcable, but not trivially (i.e. you have to code it up and possibly wait a while)

3. for conjectures that feel intuitively true more effort goes into finding the proof than looking for a counterexample that feels unlikely to exist.