The distribution function of a semiflexible polymer and random walks with constraints

Abstract

In studying the end-to-end distribution function $G(r,N)$ of a worm like chain by using the propagator method we have established that the combinatorial problem of counting the paths contributing to $G(r,N)$ can be mapped onto the problem of random walks with constraints, which is closely related to the representation theory of the Temperley-Lieb algebra. By using this mapping we derive an exact expression of the Fourier-Laplace transform of the distribution function, $G(k,p)$, as a matrix element of an inverse of an infinite rank matrix. Using this result we also derived a recursion relation permitting to compute $G(k,p)$ directly. We present the results of the computation of $G(k,N)$ and its moments. The moments $<r^{2n}>$ of can be calculated \emph{exactly} by calculating the (1,1) matrix element of $2n$-th power of a truncated matrix of rank $n+1$.

6 pages, 2 figures, added a reference

References in corpus (1)

• Adsorption of a semiflexible polymer onto interfaces and surfaces

Cited by in corpus (13)

• Exact theory of kinkable elastic polymers
• A generalized theory of semiflexible polymers
• Effective medium approach for stiff polymer networks with flexible cross-links
• Statistical mechanics of semiflexible polymers
• Elasticity of DNA and the effect of Dendrimer Binding
• Differential Geometry of Polymer Models: Worm-like Chains, Ribbons and Fourier Knots
• Elasticity of Stiff Biopolymers
• Perturbation Theory for Path Integrals of Stiff Polymers
• Modeling DNA beacons at the mesoscopic scale
• On the behaviour of short Kratky-Porod chain
• Bimodal distribution function of a 3d wormlike chain with a fixed orientation of one end
• Statistical physics and mesoscopic modeling to interpret tethered particle motion experiments
• Stiff Quantum Polymers