TOPICS
Search

Lattice Path


A path composed of connected horizontal and vertical line segments, each passing between adjacent lattice points. A lattice path is therefore a sequence of points P_0, P_1, ..., P_n with n>=0 such that each P_i is a lattice point and P_(i+1) is obtained by offsetting one unit east (or west) or one unit north (or south).

The number of paths of length a+b from the origin (0,0) to a point (a,b) which are restricted to east and north steps is given by the binomial coefficient (a+b; a).


See also

Ballot Problem, Dyck Path, Faber Polynomial, Golygon, Kings Problem, Lattice Point, p-Good Path, Random Walk, Staircase Walk

Explore with Wolfram|Alpha

References

Dickau, R. M. "Shortest-Path Diagrams." http://mathforum.org/advanced/robertd/manhattan.html.Hilton, P. and Pederson, J. "Catalan Numbers, Their Generalization, and Their Uses." Math. Intel. 13, 64-75, 1991.Mohanty, S. G. Lattice Path Counting and Applications. New York: Academic Press, 1979.Moser, L. and Zayachkowski, W. "Lattice Paths with Diagonal Steps." Scripta Math. 26, 223-229, 1963.Narayana, T. V. Lattice Path Combinatorics with Statistical Applications. Toronto, Ontario, Canada: University of Toronto Press, 1979.

Referenced on Wolfram|Alpha

Lattice Path

Cite this as:

Weisstein, Eric W. "Lattice Path." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/LatticePath.html

Subject classifications