5 papers
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 walk…
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…
Factoring the Laplacian to understand topological polymers
Jason Cantarella, Tetsuo Deguchi, Clayton Shonkwiler +1
A ring polymer is a random walk whose steps obey a single linear condition; their sum vanishes. Factoring the graph Laplacian into the product of the incidence matrix and its trans…
New Upper Bounds for Stick Numbers
Jason Cantarella, Andrew Rechnitzer, Henrik Schumacher +1
We use a version of simulated annealing with knot-type preserving moves to find polygonal representatives of various knot types with low stick number. These give better bounds on s…
An exact formula for the contraction factor of a subdivided Gaussian topological polymer
Jason Cantarella, Tetsuo Deguchi, Clayton Shonkwiler +1
We consider the radius of gyration of a Gaussian topological polymer formed by subdividing a graph of arbitrary topology (for instance, branched or multicyclic). We give a…