A computer algebra approach to the discrete Dirichlet problem
The authors consider random walks on regular lattices, in particular the classical gambler ruin problem and a two-dimensional analogue. To find the expected duration, they use generating functions, which they analyze using the method of Gröbner basis taking the normal form of a polynomial. This key implement using the symbolic software package MAPLE. The particular examples are worked out in detail.
scientific article; zbMATH DE number 710089