Scaling analysis for the adsorption transition in a watermelon network of n directed non-intersecting walks

Owczarek, A L, Essam, J W and Brak, R

(2001)

Owczarek, A L, Essam, J W and Brak, R (2001) Scaling analysis for the adsorption transition in a watermelon network of n directed non-intersecting walks. Journal of Statistical Physics, 102 (3-4).

Our Full Text Deposits

Full text access: Open

Full Text - 272.32 KB

Links to Copies of this Item Held Elsewhere


Abstract

The partition function for the problem of n directed non-intersecting walks interacting
via contact potentials with a wall parallel to the direction of the walks has previously been
calculated as an n by n determinant. Here, we describe how to analyse the scaling behaviour
of this problem using alternative representations of the solution. In doing so we derive the
asymptotics of the partition function of a watermelon network of n such walks for all tem-
peratures, and so calculate the associated network exponents in the three regimes: desorbed,
adsorbed, and at the adsorption transition. Furthermore, we derive the full scaling function
around the adsorption transition for all n. At the adsorption transition we also derive a
simple "product form" for the partition function. These results have, in part, been derived
using recurrence relations satised by the original determinantal solution.

Information about this Version

This is a Published version
This version's date is: 02/2001
This item is peer reviewed

Link to this Version

https://repository.royalholloway.ac.uk/items/2b26113b-6189-b72f-816a-bf440aec6466/1/

Item TypeJournal Article
TitleScaling analysis for the adsorption transition in a watermelon network of n directed non-intersecting walks
AuthorsOwczarek, A L
Essam, J W
Brak, R
Uncontrolled Keywordsscaling, polymers, networks, random walks, adsorption
DepartmentsFaculty of Science\Physics
Faculty of Science\Mathematics

Identifiers

doi10.1023/A:1004819507352

Deposited by () on 23-Dec-2009 in Royal Holloway Research Online.Last modified on 23-Dec-2009

Notes

E-print is the authors' final version.

References

[1] R. P. Stanley, Enumerative Combinatorics, Volume 1, Cambridge University Press, Cam-
bridge, 1997.
[2] D. Stanton and D. White, Constructive Combinatorics, Springer, New York, 1986.
[3] R. Brak, J. Essam, and A. L. Owczarek, J. Stat. Phys. 93, 155 (1998).
[4] P. J. Forrester, J. Phys. A. 22, L609 (1989).
[5] M. E. Fisher, J. Stat. Phys. 34, 667 (1984).
[6] I. M. Gessel and X. Viennot, Determinants, paths, and plane partitions, preprint, (1989).
[7] I. M. Gessel and X. Viennot, Advances in Mathematics 58, 300 (1985).
[8] A. J. Guttmann, A. L. Owczarek, and X. G. Viennot, J. Phys. A. 31, 8123 (1998).
[9] A. J. Guttmann, C. Krattenthaler, and X. G. Viennot, Unpublished, (1999).
[10] D. K. Arrowsmith, P. Mason, and J. W. Essam, Physica A 177, 267 (1991).
[11] J. W. Essam and A. J. Guttmann, Phys. Rev. E. 52, 5849 (1995).
[12] R. Brak, J. Essam, and A. L. Owczarek, J. Phys. A. 32, 2921 (1999).
[13] R. Brak and J. W. Essam, Unpublished, (1999).
[14] J. W. Essam and A. J. Guttmann, J. Phys. A. 28, 3591 (1995).
[15] R. Brak and A. L. Owczarek, J. Phys. A. 28, 4709 (1995).
[16] N. Madras and G. Slade, The Self-Avoiding Walk, Birkhauser, Boston, 1993.
[17] J. B. Wilker and S. G. Whittington, J. Phys. A. 12, L245 (1979).
[18] C. L. Dodgson, Proc. Roy. Soc. London 15, 150 (1866).
[19] D. Zhao, T. Lookman, and J. W. Essam, J. Phys. A 25, L1181 (1992).
[20] M. T. Batchelor, D. Bennett-Wood, and A. L. Owczarek, Europ. Phys. J. B 5, 139 (1998).
[21] M. Abramowitz and I. A. Stegun, Handbook of Mathematical Functions, Dover, New York,
1965.
19


Details