Characteristic length of random knotting for cylindrical self-avoiding polygons
Abstract
We discuss the probability of random knotting for a model of self-avoiding polygons whose segments are given by cylinders of unit length with radius r. We show numerically that the characteristic length of random knotting is roughly approximated by an exponential function of the chain thickness r.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.