Abstract
The number of allowed configurations of a polymer chain is considered on the basis of a random walk on an arbitrary ``regular'' lattice. Upper and lower bounds for the number of nonoverlapping configurations in various lattices have been derived by means of a recursion formula method. The probability density function and its moments for the ``head-to-tail'' distance for short-range nonoverlapping chains are shown to the calculable by the use of a generating function. The order of the logarithm of the number of nonsuperposable ring polymer chains has been shown to be directly proportional to the number of segments composing the ring.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
