Partial difference equation method for lattice path problems
From MaRDI portal
The authors recently have exactly solved the problems of the enumeration of paths on a square lattice [J. Stat. Phys. 93, No. 1-2, 155-192 (1998)], evaluating the partition functions. In this paper they discuss the application of the partial difference equation method for the case of one path in a half-plane, comparing it with the transfer matrix method, and show that this method can be easily generalized to many intersecting paths.
Recommendations
Cites work
- Binomial determinants, paths, and hook length formulae
- Exact solution ofNdirected non-intersecting walks interacting with one or two boundaries
- From the Bethe Ansatz to the Gessel-Viennot theorem
- New results for directed vesicles and chains near an attractive wall
- Vicious walkers and Young tableaux I: without walls
- Walks, walls, wetting, and melting
Cited in
(4)
This page was built for publication: Partial difference equation method for lattice path problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306599)