ترغب بنشر مسار تعليمي؟ اضغط هنا

We describe a novel algorithm for random sampling of freely reduced words equal to the identity in a finitely presented group. The algorithm is based on Metropolis Monte Carlo sampling. The algorithm samples from a stretched Boltzmann distribution be gin{align*}pi(w) &= (|w|+1)^{alpha} beta^{|w|} cdot Z^{-1} end{align*} where $|w|$ is the length of a word $w$, $alpha$ and $beta$ are parameters of the algorithm, and $Z$ is a normalising constant. It follows that words of the same length are sampled with the same probability. The distribution can be expressed in terms of the cogrowth series of the group, which then allows us to relate statistical properties of words sampled by the algorithm to the cogrowth of the group, and hence its amenability. We have implemented the algorithm and applied it to several group presentations including the Baumslag-Solitar groups, some free products studied by Kouksov, a finitely presented amenable group that is not subexponentially amenable (based on the basilica group), and Richard Thompsons group $F$.
We compute the cogrowth series for Baumslag-Solitar groups $mathrm{BS}(N,N) = < a,b | a^N b = b a^N > $, which we show to be D-finite. It follows that their cogrowth rates are algebraic numbers.
We propose a numerical method for studying the cogrowth of finitely presented groups. To validate our numerical results we compare them against the corresponding data from groups whose cogrowth series are known exactly. Further, we add to the set of such groups by finding the cogrowth series for Baumslag-Solitar groups $mathrm{BS}(N,N) = < a,b | a^N b = b a^N >$ and prove that their cogrowth rates are algebraic numbers.
A directed path in the vicinity of a hard wall exerts pressure on the wall because of loss of entropy. The pressure at a particular point may be estimated by estimating the loss of entropy if the point is excluded from the path. In this paper we dete rmine asymptotic expressions for the pressure on the X-axis in models of adsorbing directed paths in the first quadrant. Our models show that the pressure vanishes in the limit of long paths in the desorbed phase, but there is a non-zero pressure in the adsorbed phase. We determine asymptotic approximations of the pressure for finite length Dyck paths and directed paths, as well as for a model of adsorbing staircase polygons with both ends grafted to the X-axis.
In this paper the number and lengths of minimal length lattice knots confined to slabs of width $L$, is determined. Our data on minimal length verify the results by Sharein et.al. (2011) for the similar problem, expect in a single case, where an impr ovement is found. From our data we construct two models of grafted knotted ring polymers squeezed between hard walls, or by an external force. In each model, we determine the entropic forces arising when the lattice polygon is squeezed by externally applied forces. The profile of forces and compressibility of several knot types are presented and compared, and in addition, the total work done on the lattice knots when it is squeezed to a minimal state is determined.
In this paper the elementary moves of the BFACF-algorithm for lattice polygons are generalised to elementary moves of BFACF-style algorithms for lattice polygons in the body-centred (BCC) and face-centred (FCC) cubic lattices. We prove that the ergod icity classes of these new elementary moves coincide with the knot types of unrooted polygons in the BCC and FCC lattices and so expand a similar result for the cubic lattice. Implementations of these algorithms for knotted polygons using the GAS algorithm produce estimates of the minimal length of knotted polygons in the BCC and FCC lattices.
We show that the classical Rosenbluth method for sampling self-avoiding walks can be extended to a general algorithm for sampling many families of objects, including self-avoiding polygons. The implementation relies on an elementary move which is a g eneralisation of kinetic growth; rather than only appending edges to the endpoint, edges may be inserted at any vertex providing the resulting objects still lie within the same family. We implement this method using pruning and enrichment to sample self-avoiding walks and polygons. The algorithm can be further extended by mixing it with length-preserving moves, such pivots and crank-shaft moves.
Directed paths have been used extensively in the scientific literature as a model of a linear polymer. Such paths models in particular the conformational entropy of a linear polymer and the effects it has on the free energy. These directed models are simplifi
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا