28 citations · 270 across the 43 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
math.GT2026
Hard unknots are often easy from a different perspective
Jason Cantarella, Henrik Schumacher, Clayton Shonkwiler
Recent attempts to train AI models to recognize knots have produced millions of ``hard'' unknot diagrams resistant to simplification by Reidemeister moves, pass moves, or random wa…
cond-mat.stat-mech2026★ 1 cited
Random knotting in very long off-lattice self-avoiding polygons
Jason Cantarella, Tetsuo Deguchi, Henrik Schumacher +2
We present experimental results on knotting in off-lattice self-avoiding polygons in the bead-chain model. Using Clisby's tree data structure and the scale-free pivot algorithm, fo…