Topological Entanglement Complexity of Polymer Chains in Confined Geometries
Long polymer chains in solution can be highly self-or mutually entangled. Several kinds of constraints can influence entanglement properties; among them a crucial role is played by geometrical constraints, which confine the chain(s) to restricted spaces. In this paper we investigate, using analytical and numerical techniques, the effects of different kinds of geometrical constraints on the topological entanglement complexity of polymer chain(s), i.e. on the knotting and linking probabilities.
KeywordsLattice models self-avoiding polygons topological entanglement complexity knotting and linking probabilities Monte Carlo methods
Unable to display preview. Download preview PDF.
- D.W. Sumners, Knot theory and DNA, in New Scientific Applications of Geometry and Topology, Proceedings of Symposia in Applied Mathematics 45, D.W. Sumners, ed., Am. Math. Soc. (1992), 39–72.Google Scholar
- A.V. Vologodskii, A.V. Lukashin and M.D. Frank-Kamenetskii, Topological interactions between polymer chains, Soy. Phys.-JETP 40 (1974), 932–936.Google Scholar
- K.V. Klenin, A.V. Vologodskii, V.V. Anshelevich, A.M. Dykhne and M.D. Frank-Kamenetskii, Effect of excluded volume on topological properties of circular DNA, J. Biomol. Str. Dyn. 5 (1988), 1173–85.Google Scholar
- N. Madras and G. Slade, The Self-Avoiding Walk, Birkh5,user, Boston, 1993.Google Scholar
- C.E. Soteros, Knots in graphs in subsets of Z 3, in this IMA volume.Google Scholar
- D. Rolfsen, Knots and Links, Mathematics Lecture Series 7, Publish or Perish, Inc., Houston, Texas, 1976.Google Scholar
- M. Lal, “Monte Carlo” computer simulations of chain molecules. I., Molec. Phys. 17 (1969), 57–64.Google Scholar
- D.E. Knuth, The Art of Computer Programming, volume 3, Addison-Wesley, Reading MA, 1973.Google Scholar