{"title":"未纠缠聚合物环和原始路径的统计","authors":"Eugene Helfand, Dale S. Pearson","doi":"10.1002/polc.5070730111","DOIUrl":null,"url":null,"abstract":"<p>The concepts of reptation and the tube model have been successfully used to describe the dynamics of a system of entangled polymers. Attempts to apply this model have given rise to questions about the statistics of a polymer, represented by a lattice random walk, and its entanglement with an obstacle net. We have determined the number of ways such a walk can form unentangled closed loops of various types. If one reels in a general random walk from its ends, pulling out unentangled loop, one is left with the so-called primitive path, which is taken to represent the path of the tube. The probability that an <i>N</i> step random walk has a <i>K</i> step primitive path has been calculated. Asymptotic formulas for this probability are presented.</p>","PeriodicalId":16867,"journal":{"name":"Journal of Polymer Science: Polymer Symposia","volume":"73 1","pages":"71-74"},"PeriodicalIF":0.0000,"publicationDate":"1985-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/polc.5070730111","citationCount":"0","resultStr":"{\"title\":\"Statistics of unentangled polymer loops and primitive paths\",\"authors\":\"Eugene Helfand, Dale S. Pearson\",\"doi\":\"10.1002/polc.5070730111\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>The concepts of reptation and the tube model have been successfully used to describe the dynamics of a system of entangled polymers. Attempts to apply this model have given rise to questions about the statistics of a polymer, represented by a lattice random walk, and its entanglement with an obstacle net. We have determined the number of ways such a walk can form unentangled closed loops of various types. If one reels in a general random walk from its ends, pulling out unentangled loop, one is left with the so-called primitive path, which is taken to represent the path of the tube. The probability that an <i>N</i> step random walk has a <i>K</i> step primitive path has been calculated. Asymptotic formulas for this probability are presented.</p>\",\"PeriodicalId\":16867,\"journal\":{\"name\":\"Journal of Polymer Science: Polymer Symposia\",\"volume\":\"73 1\",\"pages\":\"71-74\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1985-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1002/polc.5070730111\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Polymer Science: Polymer Symposia\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/polc.5070730111\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Polymer Science: Polymer Symposia","FirstCategoryId":"1085","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/polc.5070730111","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Statistics of unentangled polymer loops and primitive paths
The concepts of reptation and the tube model have been successfully used to describe the dynamics of a system of entangled polymers. Attempts to apply this model have given rise to questions about the statistics of a polymer, represented by a lattice random walk, and its entanglement with an obstacle net. We have determined the number of ways such a walk can form unentangled closed loops of various types. If one reels in a general random walk from its ends, pulling out unentangled loop, one is left with the so-called primitive path, which is taken to represent the path of the tube. The probability that an N step random walk has a K step primitive path has been calculated. Asymptotic formulas for this probability are presented.