Self-avoiding walks on three-dimensional lattices are flexible linear objects which can be self-entangled. The authors discuss several ways to measure entanglement complexity for n-step walks, and prove that these complexity measures tend to infinity with n. For small n, they use Monte Carlo methods to estimate and compare the n-dependence of two of these complexity measures.
No takes yet. Share an insight, caveat, or question.
Rensburg et al. (1992) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: