Partial difference equation method for lattice path problems (Q1306599)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Partial difference equation method for lattice path problems |
scientific article; zbMATH DE number 1347712
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partial difference equation method for lattice path problems |
scientific article; zbMATH DE number 1347712 |
Statements
Partial difference equation method for lattice path problems (English)
0 references
10 April 2000
0 references
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.
0 references
random walks
0 references
lattice paths
0 references
partition
0 references
partial difference equation
0 references
transfer matrix method
0 references
intersecting paths
0 references
0 references
0.782382071018219
0 references
0.7467819452285767
0 references
0.7428503036499023
0 references
0.740203320980072
0 references
