Hostname: page-component-78c5997874-fbnjt Total loading time: 0 Render date: 2024-11-15T02:38:16.910Z Has data issue: false hasContentIssue false
  • English
  • Français

On Lattice Paths with Diagonal Steps

Published online by Cambridge University Press:  20 November 2018

V.K. Rohatgi
V.K. Rohatgi*
Affiliation:
University of Alberta, Edmonton
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In [1] L. Moser and W. Zayachkowski considered lattice paths from (0, 0) to (x, y) where the possible moves are of three types: (1) a horizontal step, (2) a vertical step, and (3) a diagonal step. They obtained an expression for the number of paths from (0, 0) to (n, n) lying below the main diagonal except at the terminal points. In this note we extend their results to cover any point (m, n) lying below the main diagonal.

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 7 , Issue 3 , September 1964 , pp. 470 - 472
Copyright
Copyright © Canadian Mathematical Society 1964

References

1. Moser, L. and Zayachkowski, W., Lattice paths with diagonal steps, Scripta Mathematica, Vol. XXVI, No. 3, pp. 223–229.Google Scholar