Brak, R and Essam, J W (2003) Bicoloured Dyck paths and the contact polynomial for n non-intersecting paths in a half plane.. Electronic Journal of Combinatorics, 10 (1).
Full text access: Open
In this paper configurations of n non-intersecting lattice paths which begin and end on the line y = 0 and are excluded from the region below this line are considered. Such configurations are called Hankel n-paths which make c intersections with the line y = 0 the lowest of which has length 2r. These configurations may also be described as parallel Dyck paths. It is found that replacing by the length generating function for Dyck paths, (!) P1 r=0 Cr!r, where C_r is the rth Catalan number, results in a remarkable simplification of the coefficients of the contact polynomial. In particular it is shown that the polynomial for configurations of a single Dyck path has the expansion ^ ZH 2r(1; (!)) = P1 b=0 Cr+b!b. This result is derived using a bijection between bi-coloured Dyck paths and plain Dyck paths. A bi-coloured Dyck path is a Dyck path in which each edge is coloured either red or blue with the constraint that the colour can only change at a contact with the line y = 0. For n > 1, the coefficient of !b in ^ ZW 2r (n; (!)) is expressed as a determinant of Catalan numbers which has a combinatorial interpretation in terms of a modified class of n non-intersecting Dyck paths. The determinant satisfies a recurrence relation which leads to the proof of a product form for the cofficients in the ! expansion of the contact polynomial.
This is a Published version This version's date is: 12/09/2003 This item is peer reviewed
https://repository.royalholloway.ac.uk/items/45de37f2-5bae-ec6b-daa6-8006fe8aa3c4/1/
Deposited by () on 23-Dec-2009 in Royal Holloway Research Online.Last modified on 23-Dec-2009
First published in The Electronic Journal of Combinatorics, Vol.10, no.1, 1-18 (2003).
[1] R. Brak, J. W. Essam, and A. Owczarek. New results for directed vesicles and chains near an attractive wall. J. Stat. Phys., 93:155{192, 1998. [2] R. Brak, J. Essam, and A. L. Owczarek. Exact solution of n directed non-intersecting walks interacting with one or two boundaries. J. Phys. A., 32:2921{2929, 1999. [3] R. Brak, J. Essam, and A. L. Owczarek. Partial difference equation method for lattice path problems. Annals of Comb., 3:265{275, 1999. [4] R. Brak and J. W. Essam. Directed percolation near a wall: III. excact results for the mean length and number of contacts. J. Phys. A., 31:4851{4869, 1999. [5] R. Brak, J. Essam, and A. L. Owczarek. Scaling analysis for the absorption transition in a watermelon network of n directed non-intersecting walks. J. Phys. A., 102:997, 2001. [6] R. Brak, J. Essam, and A. L. Owczarek. From the Bethe Ansatz to the Gessel-Viennot theorem. Annals of Comb., 3:251{263, 1998. [7] R. Brak and J. Essam. Return polynomials for non-intersecting paths above a surface on the directed square lattice. Submitted to J. Phys. A. 2001. [8] H. Gould. Some generalizations of Vandermond'e convolution. Amer. Mathematics Monthly., 63:84{91. 1956. [9] M. E. Fisher. J. Stat. Phys., 34:667, 1984. [10] X. Viennot. A combinatorial interpretation of the quotient-difference algorithm. Preprint, 1986. [11] I. Gessel and X. Viennot. Binomial determinants, paths, and hook length formulae. Adv. Math., 58:300{321, 1985. [12] I. Gessel and X. Viennot. Determinants, paths, and plane paritions. 1985. Preprint. [13] C. L. Dodgson. Proc. Roy. Soc. London, 1866.