论文信息 - Polymer entanglement in melts

Polymer entanglement in melts

We propose a new way of characterizing the entanglement complexity of concentrated polymer solutions and polymer melts. This involves considering a randomly chosen cube in the system, and investigating the entanglements between sub-chains in this cube. We present Monte Carlo calculations and scaling arguments for the density dependence of the entanglement complexity, and the way in which this behaviour scales with the size of the chosen cube.

[1] P. Gennes. Stracasol: A joint french effort on the physics of flexible chains , 1977 .

[2] Bernd A. Berg,et al. Random paths and random surfaces on a digital computer , 1981 .

[3] R. Dickman,et al. High density Monte Carlo simulations of chain molecules: Bulk equation of state and density profile near walls , 1988 .

[4] Sanford Weisberg,et al. Computing science and statistics : proceedings of the 30th Symposium on the Interface, Minneapolis, Minnesota, May 13-16, 1998 : dimension reduction, computational complexity and information , 1998 .

[5] Sergio Caracciolo,et al. Polymers and g|φ|4 theory in four dimensions , 1983 .

[6] Alon Orlitsky,et al. Monte Carlo generation of self-avoiding walks with fixed endpoints and fixed length , 1990 .

[7] A. W. Rosenbluth,et al. MONTE CARLO CALCULATION OF THE AVERAGE EXTENSION OF MOLECULAR CHAINS , 1955 .

[8] S. Whittington,et al. A Monte Carlo algorithm for lattice ribbons , 1996 .

[9] S G Whittington,et al. Random linking of lattice polygons , 1994 .