# Elastic Lattice Polymers

## Abstract

We study a model of “elastic” lattice polymer in which a fixed number of monomers is hosted by a self-avoiding walk with fluctuating length . We show that the stored length density scales asymptotically for large as , where is the polymer entropic exponent, so that can be determined from the analysis of . We perform simulations for elastic lattice polymer loops with various sizes and knots, in which we measure . The resulting estimates support the hypothesis that the exponent is determined only by the number of prime knots and not by their type. However, if knots are present, we observe strong corrections to scaling, which help to understand how an entropic competition between knots is affected by the finite length of the chain.

###### pacs:

02.10.Kn, 36.20.Ey, 36.20.-r, 87.15.A-## I Introduction

According to renormalization group theory, the scaling properties of critical systems are insensitive to microscopic details and are governed by a small set of universal exponents Pelissetto and Vicari (2002). Also polymers can be considered as critical systems in the limit where their length (the number of chained monomers) diverges de Gennes (1979); des Cloizeaux and Jannink (1990); Vanderzande (1998). For instance, the radius of gyration of an isolated polymer in a swollen phase scales as , where Clisby (2010) in dimensions is a universal critical exponent. One of the simplest models in the universality class of swollen polymers is that of self-avoiding walks (SAWs) on a lattice. Hence, these have been used extensively to extract information on critical exponents and scaling functions Clisby (2010); de Gennes (1979); Vanderzande (1998); BFACF (); Nienhuis (1982); Seno and Stella (1988); Ishinabe (1989); Madras and Sokal (1988); Brak et al. (1993); Grassberger and Hegger (1995); Orlandini et al. (1996, 1998); Caracciolo et al. (1998); Jensen and Guttmann (1999); Jensen (2004); Rechnitzer and Janse van Rensburg (2002); Janse van Rensburg and Rechnitzer (2008); Clisby et al. (2007); Wolterink et al. (2006); van Heukelum and Barkema (2003); Baiesi et al. (2001). The total number of SAWs, i.e. their partition function, has the following large- expansion

(1) |

Here non-universal (model-dependent) quantities are the connectivity constant and the amplitude of the corrections to scaling . The entropic exponent depends only on boundary conditions: in we have Hsu et al. (2004) for an open chain whereas Clisby (2010) for self-avoiding polygons (SAPs), that is, linear chains with the two ends on adjacent lattice sites. Renormalization group analysis suggests that the exponent , characterizing the leading corrections to the scaling behavior, is also universal Pelissetto and Vicari (2002); des Cloizeaux and Jannink (1990)

Models with full self-avoidance, such as SAPs, have been used to study the statistical properties of knotted chains Janse van Rensburg and Whittington (1990); Janse van Rensburg et al. (1997); Orlandini et al. (1996, 1998); Deguchi and Tsurusaki (1997); Matsuda et al. (2003); Metzler et al. (2002); Zandi et al. (2003); Marcone et al. (2005); Orlandini and Whittington (2007); Janse van Rensburg and Rechnitzer (2008); Baiesi et al. (2007, 2009, ). Knots in polymers have attracted a lot of attention during the past years, also because of their occurrence in biopolymers as DNAs, RNAs and proteins Stasiak et al. (1996); Rybenkov et al. (1993); Arsuaga et al. (2005); Taylor (2000); Lua and Grosberg (2006); Burnier et al. (2008). As usual, SAWs represent a minimal effective model to grasp the essential, coarse-grained features of polymer chains. Simulations of knotted SAPs in ensembles with fixed topology are performed with a grand-canonical algorithm (BFACF BFACF (), from the name of the authors) tuned to span a range of chain lengths (algorithms with fixed are not ergodic in this case). For this algorithm, the tuning of step fugacities to is necessary to achieve samplings of long chains. It would be desirable to have a simpler and more stable method to sample the same chain lengths.

In this paper we study a class of polymers referred to as the elastic lattice polymers (ELPs), which are SAWs accumulating some stored length along their contour. This leads in fact to a partial lifting of the self-avoidance condition between consecutive monomers of an ELP, as sketched in Fig. 1. We will consider equilibrium properties of polymers with a fixed number of monomers , and in which as a consequence the length of the self-avoiding backbone described by the monomers fluctuates. This explains the name “elastic”, and implies a resemblance with the class of grand-canonical SAW models.

There are several reasons for studying this model. On the theoretical side, it can be considered as an enhanced SAW: besides sharing critical exponents with SAWs, its fluctuating length enables new avenues to estimate critical exponents. ELPs have been used in studies of polymer dynamics as phase separation in polymer melts van Heukelum and Barkema (2003), or in translocation through nanopores Wolterink et al. (2006), but their equilibrium properties have so far received little attention.

The key quantity we focus on is the equilibrium averaged stored length density defined as

(2) |

where depends on . As will be shown, has a simple asymptotic behavior for large from which one can extract universal exponents: the leading correction to the asymptotic value for scales as , where is the entropic exponent defined by Eq. (1). We illustrate the result of this approach for the case of ELPs with fixed knots. If knots are present, the stored length approaches its asymptotic value with strong, knot-dependent corrections to scaling. The expectation of a homogeneous stored length within an equilibrated chain, combined with the knowledge on how its density varies with the chain length, leads us to a new view on the issue of entropic competition of knotted regions Zandi et al. (2003). On the numerical side, we find that ELPs, compared to grand-canonical algorithms, have the nice feature of stabilizing the sampling quite narrowly around an easily tunable length .

This paper is organized as follows. In Section II we derive the expansion for as a function of . In Section III, we illustrate how to estimate entropic exponents via fits of , with a reweighting of exact enumeration data for polymers on square and cubic lattices. In Section IV we present Monte Carlo simulations of ELPs containing a fixed knot and determine the averaged stored length in equilibrium as a function of . The entropic exponent is determined for different simple and double knots. Finally, in Section V, we discuss, on the basis of the obtained scaling behavior for , different possible scenarios for knot competitions.

## Ii Scaling properties of the stored length

Consider a polymer composed by monomers with lattice coordinates defined by , . Multiple occupancy of neighboring monomers on the same lattice site means that we allow configurations for which . However if and , then no monomers other than those of the interval are allowed to visit the site . The lattice polymer so defined describes a self-avoiding backbone of length . The two extremal cases are all monomers occupying the same lattice point () and a fully stretched configuration without multiple occupancy (). The equilibrium partition function for an ELP with monomers is given by

(3) |

where the sum is over the length of the self-avoiding backbone and is the canonical partition function, which counts the number of allowed configurations for the self-avoiding backbone, and whose asymptotic is given in Eq. (1). The factor in Eq. (3) counts the number of ways the stored length can be distributed over the backbone. For convenience an extra fugacity per site has been added.

It is instructive to consider first the case of a partition function of the type in Eq. (3), i.e. neglecting power-law and correction to scaling terms in Eq. (1). In this case Eq. (3) becomes

(5) |

Equation (5) has the following interpretation: the partition function for a walk of steps factorizes as each monomer can either sit on the backbone (accumulating stored length with weight ) or occupy a free site (with average weight ). From Eq. (4) we get the following value of the averaged backbone length

(6) |

We now go back to the full partition function in Eq. (3). For large and fixed the binomial factor is sharply peaked around . We approximate the binomial by a Gaussian distribution as follows:

(7) |

where

(8) |

The Gaussian approximation differs from the binomial by terms which are exponentially small for large , which are of higher order in the large- expansion we are interested in, so they can be safely neglected. We replace now the discrete sum in Eq. (3) by an integral over all lengths, extending the domain of integration in the whole real axis:

(9) |

where we have replaced the asymptotic form of as given in Eq. (1). The replacement of the sum by an integral brings corrections in Eq. (9) which are of higher order in and for our purposes can be neglected.

We solve the integral in Eq. (9) by using a saddle point approximation. A simple rescaling gives

(10) |

with

(11) |

Let the maximum of . We have:

(12) | |||||

Equation (11) implies that the maximum of in the large- limit is , giving

(13) |

which produces higher-order terms, which we neglect in the large- expansion. In addition:

(14) |

Equations (12), (13) and (14) again show that the leading contribution to the partition function is , but also that the subleading contribution has the same entropic exponent of SAWs. From Eq. (4) we get

(15) |

and the stored length density (2) becomes

(16) |

where we defined

(17) |

The expansion (16) is valid provided . The neglected terms coming from the replacement of the sum with an integral, and from the Gaussian integration in Eq. (10), are of the order (except if , the terms would dominate over the .) The value of the exponent can then be obtained from a plot of vs. , as the slope in the limit . Using the high-precision literature values for the connectivity constants , one obtains a very accurate estimate of .

With the definition of in (17) we can rewrite the variance (8) as

(18) |

This form reveals clearly that the largest for a given is achieved with , i.e. with a fugacity . We can think of this regime as the maximally elastic one. In all cases, note that the relative polydispersity of the chains goes to zero for , hence the chain lengths are narrowly distributed around their average . This allows us to use saddle-point approximations (see Sect. V) and leads to metric properties in the universality class of SAWs (e.g. radius of gyration scaling as ). Hence, ELPs share both exponents and with SAWs.

## Iii Stored length from exact enumerations data

As a first illustration of the scaling behavior of the stored length as a function of the number of monomers , we consider exact enumeration data for SAWs and SAPs on square and cubic lattices, which are taken from the published literature Jensen (2004). Enumeration techniques provide exact values for the total number of SAWs as a function of their length . We use these values for to compute from Eq. (3). The stored length is obtained from the average , using Eq. (2). We have the freedom to choose the value of the fugacity in Eq. (3).

Figure 2 shows a plot of as a function of for three and two dimensions, obtained by setting in Eq. (3). The data converge to the expected asymptotic value, which is (cubic) and (square). These are obtained from Eq. (17) with and the following values for the connectivity constants: Clisby et al. (2007) (cubic) and (square) Jensen and Guttmann (1999).

The solid lines in Fig. 2 are the linear terms in the expansion of Eq. (16) where the value of is that for open walks ( in and in ) and polygons ( in and in ). The results show that the linear scaling in sets in already for short polymers (). In addition we observe that the corrections to the leading scaling behavior are stronger for closed walks (empty circles) compared to the open walks case (filled circles).

type | max Jensen (2004) | ||

SAW, | 71 | ||

SAP, | 110 | ||

SAW, | 30 | – | |

SAP, | 32 | – |

We performed finite-size extrapolations to obtain estimates of from . The two-dimensional data have been extrapolated by means of the Burlisch-Stoer (BST) algorithm Henkel and Schutz (1988), using the finite- approximants

(19) |

which are the ratios between slope and intercept of the line joining the points and , i.e. they are finite-size estimates of the ratio between and . The BST algorithm starts with a sequence of elements, and generates iteratively sequences of , elements which are expected to converge faster at each iteration step. It involves a free parameter (), which roughly measures the effective leading correction exponent. In our extrapolations, an optimal value of was selected requiring a minimal standard deviation of the last five sequences generated by the iterative algorithm. The extrapolations were repeated for different values of the fugacity parameter and the error was estimated from the variation on these values. For three-dimensional data, the BST algorithm turned out not to be very accurate, particularly for loops. The reason is that for small has some subleading oscillatoric behavior which is not sufficiently damped during the BST iterations. The result is that the accuracy of the extrapolation is poor. For these data we use instead a non-linear fit, fixing and keeping , and as fitting parameters.

The extrapolated values for are reported in Table 1; these are accurate and in good agreement with exact data in two dimensions and also with the best numerical estimates in three dimensions ( Hsu et al. (2004) for walks, for polygons — assuming hyperscaling with Clisby (2010)), which shows that reliable values of the entropic exponents can be extracted from the scaling of the stored length.

## Iv Entropic exponents of knotted polymers

We now turn to the study of equilibrium properties of ELP rings with some fixed topology. Here we will show how the knowledge of the stored length can be exploited to investigate equilibrium properties of knotted polymers.

We have performed Monte Carlo simulations of ELPs on the face-centered-cubic (fcc) lattice, with an algorithm that was recently used to study translocation dynamics Wolterink et al. (2006) and phase separation in polymer melts van Heukelum and Barkema (2003). The allowed Monte Carlo update moves include reptation, i.e. the diffusion of stored length along its backbone and Rouse-like moves which locally change the backbone configuration. (For more details see Ref. van Heukelum and Barkema (2003)).

The setup of the simulation is as follows. We start from a backbone with a minimal number of steps on the fcc lattice, as those shown in Fig. 3. A total number of monomers are distributed randomly over this backbone. These configurations are then relaxed to equilibrium. Typically is much larger than the initial length (we simulated polymers with up to ) so that relaxation to equilibrium corresponds to an expansion of the backbone. The Monte Carlo moves preserve the knot topology imposed initially. Once equilibrium is reached we start the sampling of the stored length density .

An additional weight (equal to ) is introduced for moves that accumulate monomers on the same lattice point, which corresponds to a fugacity factor in Eq. (3). This leads to the following asymptotic value for the stored length density:

(20) |

where the numerical value is obtained by considering the most accurate
available estimate Ishinabe (1989) for the connectivity
constant of SAWs on fcc lattice ^{1}

Figure 4 shows the scaling behavior of as a function of for an unknotted polymer ring, for single and double knots. All data converge asymptotically to the value obtained from Eq. (20). This value is shown as a dashed horizontal line in Fig. 4. We note that the approach to of the numerical data for unknotted rings is quite different for those of rings with knots (a detail of the asymptotic region is shown in the inset of Fig. 4): the data for the unknotted topology approach the asymptotic value with a clear scaling behavior. For topologies with knots instead there is a pronounced curvature in the vs. plot, deriving from strong corrections to scaling. These corrections are stronger for an increasing knot complexity and for an increasing number of knots. The shortest length of a knot on a lattice is a good indicator of its complexity, and in this model for by definition the chain can only be fully stretched, i.e. . Our data show that the crossover from this initial topological stretching to the asymptotic regime grows quickly with the value of . In this view, the fact that for unknotted chains on the fcc lattice one has , much smaller than that of the simplest knot (the trefoil with ) explains why corrections to scaling are negligible for unknotted chains.

Knot type | range of | ||

unknotted | — | ||

- | |||

- | |||

- | |||

- | |||

- | |||

- |

We estimated the entropic exponent using the scaling behavior predicted by Eq. (16). In the unknotted case due to the manifest absence of curvature of the data, we restricted ourselves to a linear fit setting and in Eq. (16) and using as the only free parameter. The fit, restricted to , yields , confirming that the entropic exponent for rings with fixed unknotted topology is identical to that for SAPs with no topological constraints.

A closer look at the data reveals that the stored length density for knots , and is non-monotonic. As the data asymptotically approach from above, Eq. (16) implies a negative value of the exponent . We performed a non-linear three-parameters fit to the data based on Eq. (16): , and are fitting parameters while we fix , as predicted by Eq. (20). The results of the non-linear fits are given in Table 2. The estimated exponent changes sign from single knot () to double knots (). A range of correction-to-scaling exponents providing optimal fits were selected and these are given in the third column of Table 2. Error estimates for reflect the variability in from the different values of used in the analysis. For the knots studied, the most accurate estimate for is that of the knot, yielding . The error increases with the knot complexity. For single knots we also note a change in the range of correction-to-scaling exponents from for the knot to in the other knots.

It has been suggested Orlandini et al. (1996, 1998); Baiesi et al. () that for a knot with prime components, the entropic exponent is given by , where is the exponent for a polymer ring without fixed topology. If this is the case we expect for a single knot an exponent while for double knots (these conjectured values are shown as dashed lines in the inset of Fig. 4). The idea behind this suggested scaling is that localized knots are like sliding entities, which can occupy any of the sites of a chain, thus contributing entropically with a factor in the partition function. Our numerical results fully support this conjecture for the single knot and also for the double knot. Results for the other knots seem to overestimate with respect to the conjectured values. It is likely that the deviations from the conjectured values are due to strong finite-size effects. An indication of this is the value of the correction-to-scaling exponent obtained from the fits, which, with the exception of the knot, is estimated as . Renormalization group arguments Pelissetto and Vicari (2002) for magnetic models, which map into polymer models in the limit de Gennes (1979), predict instead , and Clisby Clisby (2010) finds in simulations of very long SAWs (this is in agreement with the range of values obtained in the extrapolations of the numerical data for the knot, see Table 2). We also remark that a value is at odds with the expansion of the stored length of Eq. (16) in which it was implicitly assumed , the term would be otherwise dominated by corrections, which were neglected in the computation of leading to Eq. (16).

In the sequel we fix the entropic exponents to the conjectured values and subtract from the constant and leading correction in as

(21) |

For this quantity we expect the following scaling behavior

(22) |

where a next-order term has been added.

Knot type | ||
---|---|---|

Figure 5 plots , where we set , as a function of . The fact that this quantity approaches a constant value for large supports an estimate of the correction-to-scaling exponent , as expected for swollen polymers Vanderzande (1998). In addition the constant is negative and its magnitude quickly increases with knot complexity. This is also visible in Fig. 4 as the effect of increasing is that of producing an increased curvature in a plot of vs. . It is perhaps not surprising that finite-size effects increase with the knot complexity, as more complex knots are expected to occupy a larger portion of the polymer. In table 3 we list our estimates of and , obtained by means of linear fits to data in the form vs. . The values of are almost two orders of magnitude larger than those of , explaining the fitted (effective) leading exponent .

## V Knots competition

In this Section we discuss entropic competition between knotted polymers in the context of ELPs. The idea of entropic competition between polymers with various constraints was introduced in Ref. Zandi et al. (2003) as a direct way to estimate polymer entropic exponents from canonical simulations. This idea is sketched in Fig. 6 and can be implemented in various ways. One can consider, for instance, a polymer loop divided in two sides by a wall (Fig. 6(a)); the two sides exchange monomers via sufficiently small holes such that the knots cannot pass through. The exchange can also occur through a fictitious “wormhole” Zandi et al. (2003), as shown in Fig. 6(b). The polymers at the two sides of the wall or those exchanging monomers through the wormhole do not interact with each other. When exchanging monomers the length of each loop fluctuates, while the total length is fixed to a constant . The method Zandi et al. (2003) is based on the analysis of the equilibrium distribution of lengths of the two sides. For ordinary polymers one expects that the length of one polymer ring is distributed according to

(23) |

where the two ’s are the loop partition functions given in Eq. (1). The main point is that the dependence on in Eq. (23) is irrelevant as is fixed, whereas from the analysis of the shape of the probability as a function of it is possible to fit the values of the entropic exponents and of the two loops Zandi et al. (2003).

### Entropic competition without a wall

We first consider the case depicted in Fig. 6(b), and we discuss a few representative examples. If the two loops both have negative entropic exponents (), then one expects a as depicted in Fig. 7(a) (thick line and shaded area), whereas the case is depicted in Fig. 7(b) (same notation; in these figures, for convenience we show the distribution , which is just a rescaling of ). The thin lines in Fig. 7(a) and (b) show sketches of finite- distributions of for increasing : particularly interesting is the scenario depicted in Fig. 7(a), which shows a drastic change of the shape of the distribution from a finite to the the limit . We will discuss here how some of these features can be understood from the analysis of the stored length densities and of the competing loops.

Let us consider , the probability of finding monomers in one of the two entropically competing ELP loops. This quantity scales as

(24) |

where the two s are the partition functions of the two competing ELPs at fixed monomer numbers and with fluctuating lengths. To find the most probable value of the monomer number observed in the entropic competition setup, we maximize the entropy

(25) |

( is the Boltzmann constant). The partition functions of ELPs in Eq. (3) are expressed as a sum over all lengths . The sum is however dominated by a characteristic value of obtained from the condition

(26) |

where we defined

(27) |

Now assuming that is dominated by a single value of we can compute the total derivative in of as

(28) | |||||

In this derivation we used Eq. (26), so in the total derivative with respect to we can ignore the -dependence coming from . Combining Eqs. (25) and (28) we find that the extremum of the entropy of the competing rings is given by the value of for which

(29) |

To find one can plot and vs. and in the same graph: each intersection point between the two curves is an extremum of . To decide whether this is a local maximum or minimum one analyzes the second derivative

(30) |

In Fig. 8 we show some plots of the stored-length densities for the two competing loops containing knots. The two loops have a total number of monomers equal to and the data are those shown in Fig. 4, but now plotted as function of and . As seen in the previous section, the stored length density can be non-monotonic in for some knotted configurations, which can produce various scenarios where up to three intersection points are possible.

Figure 8(a) shows the example of two competing double knots. In this case there is a single intersection point and the analysis of the first derivatives of shows that this point is a local maximum for the entropy (Eq. (30)). The probability distribution of monomers (or lengths in the canonical setup) will have a single maximum at some intermediate , as shown in the example of Fig. 7(b). In the case of two unknotted loops (Fig. 8(b)) the intersection point is a minimum for the entropy, hence the probability distribution for will be maximal at the edges and minimal at , as for the thick line in Fig. 7(a). The most interesting case is that of competition between loops with non-monotonic ’s. This case is illustrated in Fig. 8(c). The three intersection points are a central local minimum of the entropy enclosed by two local maxima. The probability distribution of lengths is like that depicted as a dashed line in Fig. 7(a). It is easy to see that if the total number of monomers decreases (this corresponds to shift one of the two ’s along the horizontal axis) there will be only one intersection point. This generates a probability distribution with a single maximum for (thin dense line in Fig. 7(a)). Interestingly, the length distributions obtained from Monte Carlo simulations Zandi et al. (2003) of competing off-lattice flexible rings with simple knots give, for sizes up to monomers, concave distributions, contrary to the expectations of negative ’s from the conjecture of Ref. Orlandini et al. (1996), which would instead correspond to a convex (i.e. with a minimum in the middle) shape. The non-monotonicity in of the stored-length density explains this drastic change in behavior in finite-size data.

To complete the discussion we consider next an example where no intersection point is present (Fig. 8(d)). In this case one has to resort to the full form of : from the scaling of partition functions of SAPs, the probability of a state with monomers on the side with no knots is expected to scale as with a cutoff at . It implies that the average length of the unknotted subchain is weakly scaling with , and at least in this case the competition is clearly in favor of the side with knots. This reminds us that the full statistics given by would often be necessary to compute average quantities, and that the maxima are only indicative elements. Nevertheless, we have seen that the density of stored length is a useful quantity for understanding the basic properties of the entropy of competing knotted chains. In particular, knowing it and its short- features helps to interpret the numerical results and to distinguish preasymptotic scalings from asymptotic ones.

### Entropic competition with a wall

Let us finally go back and reconsider briefly the entropic competition of knots divided by a wall, as in Fig. 6(a). The main difference is that the basic exponent of the unknotted chain should be . The additional index is connected to the constraint of having a monomer of a loop confined close to a hard surface. The formula is an application of Duplantier’s general theory of polymer networks Duplantier (1989); Schäfer et al. (1992). We use this theory also to extract from the data in Ref. Gaunt and Colby (1990), obtaining . This means that . Again the full zoology of possible competitions could be simply discussed by repeating the above reasoning, once data of for ELPs close to a wall are generated. We reserve this investigation for a future work. Let us just note that the condition , associated with a single maximum of the entropy at , is now met for a minimal number of prime knots per loop, i.e. one more than we needed in the case without the wall. Thus, the wall separating the chains has somewhat the effect of repelling entropically also the knots.

## Vi Conclusions

In this paper we studied the scaling properties of a class of polymers, which we have referred to as elastic lattice polymers (ELPs). These polymers can accumulate stored length along their backbone, by lifting the self-avoidance condition for neighboring monomers. The length of their backbone fluctuates, whereas the total number of monomers is fixed. Differently from true grand canonical polymers, however, the backbone length is bounded to , and fluctuates around with fluctuations .

ELPs were used in the past to study the dynamics of polymer melts van Heukelum and Barkema (2003) and pore translocation dynamics Wolterink et al. (2006), but their equilibrium behavior has received little attention. In this work, we used ELPs to investigate entropic exponents of knotted polymer rings. The calculation of polymer entropic exponents from classical Monte Carlo simulations of canonical self-avoiding rings is rather cumbersome: one has either to employ complex grand canonical sampling, or to resort to the so-called atmospheres method Janse van Rensburg and Rechnitzer (2008) or entropic competition methods Zandi et al. (2003). ELPs are well suited to this type of problem. Firstly, the underlying Monte Carlo dynamics can be based solely on local moves (thus conserving the knot topology) and the possibility of accumulating length along the backbone facilitates the sampling of different configurations compared to canonical self-avoiding rings. The ELP explores new configurations through sliding moves along the backbone. Secondly, we have shown that there is a natural variable associated to ELPs which is the stored length density (see Eq. 2), which measures the average fraction of monomers accumulated on the backbone. We have derived an expansion for in the limit , where converges to a value that depends on the connectivity constant of the ordinary lattice polymers. The next leading behavior is of the order , with the entropic exponent of the polymers. This allows one to estimate entropic exponents from the scaling analysis of . As examples of application of this, we estimated entropic exponents of swollen polymers in and , and of polymers with various types of knots. Comparing the results with conjectured values of these exponents, we find a clear agreement at least for the simplest knot studied. For more complex knots the agreement is only marginal, due to finite-size effects quickly increasing with the knot complexity.

One of the advantages of the stored length analysis is that correction-to-scaling effects are directly visible in vs. plots as they appear as deviations from a linear scaling behavior. Our analysis showed that finite-size effects become stronger with the knot complexity and with the number of knots. Similar result have been observed by Janse van Rensburg and Rechnitzer Janse van Rensburg and Rechnitzer (2008). These authors estimated the connectivity constant and entropic exponent of lattice polymers via the atmosphere method Rechnitzer and Janse van Rensburg (2002), where, roughly speaking, atmospheres are the loci where the polymer can be expanded and contracted. Interestingly, there is a similarity between the scaling of the average atmospheres and that of the stored-length density of ELPs discussed in this paper.

With simulations of ELPs we have shown how important are corrections to scaling in the statistics of knotted polymers: their equilibrium properties in entropic competition can be understood from coexistence diagrams of stored lengths of ELPs. The non-monotonicity of the stored length density as function of explains some features of the competing rings observed in canonical Monte Carlo simulations Zandi et al. (2003) which were poorly understood before.

Summarizing, the elastic lattice polymer is a simple model sharing critical exponents with the self-avoiding walk, but it has an additional “elastic” degree of freedom in its fluctuating length, which offers numerical advantages and additional theoretical tools to derive critical exponents of polymers. Thus, the ELP is a valid alternative to classical lattice models for studies in polymer physics.

Acknowledgments: G.B. and M.B. acknowledge hospitality from the Institute of Theoretical Physics at the K.U.Leuven and financial support from the Research Foundation-Flanders (FWO) Grant No. G.0311.08. M.B. acknowledges financial support from the University of Padua (Progetto di Ateneo n. CPDA083702).

### Footnotes

- In principle we should consider the connectivity constant of the ensemble of configurations with a given knot, which is slightly smaller than . However, their estimated difference Baiesi and Orlandini () is smaller than the numerical error for .

### References

- A. Pelissetto and E. Vicari, Phys. Rep. 368, 549 (2002).
- P.-G. de Gennes, Scaling Concepts in Polymer Physics (Cornell University Press: Ithaca, USA, 1979).
- J. des Cloizeaux and G. Jannink, Polymers in solution: Their modeling and structure (Clarendon Press, 1990).
- C. Vanderzande, Lattice Models of Polymers (Cambridge University Press, Cambridge, 1998).
- N. Clisby, Phys. Rev. Lett. 104, 055702 (2010).
- B. Berg and D. Foerster, Phys. Lett. B 106, 323 (1981). C. Aragão de Carvalho, S. Caracciolo, and J. Fröhlich, Nucl. Phys. B 215, 209 (1983).
- B. Nienhuis, Phys. Rev. Lett. 49, 1062 (1982).
- F. Seno and A. L. Stella, J. Phys. (France) 49, 739 (1988).
- T. Ishinabe, Phys. Rev. B 39, 9486 (1989).
- N. Madras and A. D. Sokal, J. Stat. Phys. 50, 109 (1988).
- R. Brak, A. L. Owczarek, and T. Prellberg, J. Phys. A: Math. Gen. 26, 4565 (1993).
- P. Grassberger and R. Hegger, J. Phys. I France 5, 597 (1995).
- E. Orlandini et al., J. Phys. A: Math. Gen. 29, L299 (1996).
- E. Orlandini, M. C. Tesi, E. J. Janse van Rensburg, and S. G. Whittington, J. Phys A: Math. Gen. 31, 5953 (1998).
- S. Caracciolo, M. S. Causo, and A. Pelissetto, Phys. Rev. E 57, R1215 (1998).
- I. Jensen and A. J. Guttmann, J. Phys. A: Math. Gen. 32, 4867 (1999).
- I. Jensen, J. Phys. A: Math. Gen. 37, 5503 (2004).
- A. Rechnitzer and E. J. Janse van Rensburg, J. Phys. A: Math. Gen. 35, L605 (2002).
- E. J. Janse van Rensburg and A. Rechnitzer, J. Phys. A: Math. Theor. 41, 105002 (2008).
- N. Clisby, R. Liang, , and G. Slade, J. Phys. A: Math. Theor. 40, 10973 (2007).
- J. K. Wolterink, G. T. Barkema, and D. Panja, Phys. Rev. Lett. 96, 208301 (2006).
- A. van Heukelum and G. T. Barkema, J. Chem. Phys. 119, 8197 (2003).
- M. Baiesi, E. Orlandini, and A. L. Stella, Phys. Rev. Lett. 87, 070602 (2001).
- H.-P. Hsu, W. Nadler, and P. Grassberger, Macromolecules 37, 4658 (2004).
- R. Zandi, Y. Kantor, and M. Kardar, ARI Bull. Instanbul Tech. Univ. 53, 6 (2003).
- E. J. Janse van Rensburg and S. G. Whittington, J. Phys. A: Math. Gen. 23, 3573 (1990).
- E. J. Janse van Rensburg, E. Orlandini, D. W. Sumners, M. C. Tesi, and S. G. Whittington, J. Knot Th. Ramif. 6, 31 (1997).
- T. Deguchi and K. Tsurusaki, Phys. Rev. E 55, 6245 (1997).
- H. Matsuda, A. Yao, H. Tsukahara, T. Deguchi, K. Furuta, and T. Inami, Phys. Rev. E 68 011102 (2003).
- R. Metzler, A. Hanke, P. G. Dommersnes, Y. Kantor, and M. Kardar, Phys. Rev. Lett. 88, 188101 (2002).
- B. Marcone, E. Orlandini, A. L. Stella, and F. Zonta, J. Phys. A: Math. Theor. 38, L15 (2005).
- E. Orlandini and S. G. Whittington, Rev. Mod. Phys. 79, 611 (2007).
- M. Baiesi, E. Orlandini, and A. L. Stella, Phys. Rev. Lett. 99, 058301 (2007).
- M. Baiesi, E. Orlandini, and S. G. Whittington, J. Chem. Phys. 131, 54902 (2009).
- M. Baiesi, E. Orlandini, and A. L. Stella, The entropic cost to tie a knot, arXiv:1003.5134, accepted in J. Stat. Mech. (2010).
- A. Stasiak, V. Katritch, J. Bednar, D. Michoud, and J. Dubochet, Nature (London) 384, 122 (1996).
- V. V. Rybenkov, N. R. Cozzarelli, and A. V. Vologodskii, Proc. Natl. Acad. Sci. USA 90, 5307 (1993).
- J. Arsuaga, M. Vazquez, P. McGuirk, S. Trigueros, D. Sumners, and J. Roca, Proc. Natl. Acad. Sci. USA 102, 9165 (2005).
- W. R. Taylor, Nature (London) 406, 916 (2000).
- R. C. Lua and A. Y. Grosberg, PLoS Comp. Bio. 2, 0350 (2006).
- Y. Burnier, J. Dorier, and A. Stasiak, Nucleic Acids Res. 36, 4956 (2008).
- M. Henkel and G. Schutz, J. Phys. A: Math. Gen. 21, 2617 (1988).
- B. Duplantier, J. Stat. Phys. 54, 581 (1989).
- L. Schäfer, C. von Ferber, U. Lehr, and B. Duplantier, Nucl. Phys. B 374, 473 (1992).
- D. S. Gaunt and S. A. Colby, J. Stat. Phys. 58, 539 (1990).
- M. Baiesi and E. Orlandini, Self-avoiding walks on the face-centered cubic lattice, in preparation.