LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Linking and link complexity of geometrically constrained pairs of rings

Photo by scottwebb from unsplash

We investigate and compare the effects of two different constraints on the geometrical properties and linking of pairs of polygons on the simple cubic lattice, using Monte Carlo methods. One… Click to show full abstract

We investigate and compare the effects of two different constraints on the geometrical properties and linking of pairs of polygons on the simple cubic lattice, using Monte Carlo methods. One constraint is to insist that the centres of mass of the two polygons are less than distance d apart, and the other is to insist that the radius of gyration of the pair of polygons is less than R. The second constraint results in links that are quite spherically symmetric, especially at small values of R, while the first constraint gives much less spherically symmetric pairs, prolate at large d and becoming more oblate at smaller d. These effects have an influence on the observed values of the linking probability and link spectrum.

Keywords: geometrically constrained; link complexity; pairs rings; linking link; complexity geometrically; constrained pairs

Journal Title: Journal of Physics A: Mathematical and Theoretical
Year Published: 2021

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.