Partial difference equation method for lattice path problems

DOI10.1007/BF01608787MaRDI QIDQ1306599zbMATH OpenFDO

Authors J. W. Essam, R. Brak, Aleksander L. Owczarek

Publication date 10 April 2000

Published in Annals of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

partitionrandom walkslattice pathspartial difference equationtransfer matrix methodintersecting paths

Mathematics Subject Classification ID

Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Exact enumeration problems, generating functions (05A15) Additive difference equations (39A10)

Recommendations

• A probabilistic method for lattice path enumeration
• Exact solutions of lattice polymer models
• The research and progress of the enumeration of lattice paths
• Counting lattice paths by using difference equations with non-constant coefficients
• scientific article; zbMATH DE number 1058045

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)

• Searching for Differential Paths in MD4
• Difference Equations and Generating Functions for some Lattice Path Problems
• A probabilistic method for lattice path enumeration
• Constant term solution for an arbitrary number of osculating lattice paths

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)