• Journal of the Korean Mathematical Society
• /
• v.33 no.2
• /
• pp.413-421
• /
• 1996

A path g in the plane $R^2$ is the sequence of the points $(t_0, t_1, \ldots, t_n)$, with coordinates in $Z^2$. The point $t_0$ is the starting point and the point $t_n$ is the arriving point. An elementary step of g is a couple $(t_i, t_{i+1}), 0 \leq i \leq n - 1$. We denote the length of the path g by $\mid$g$\mid$ = n.

• Journal of the Korean Mathematical Society
• /
• v.34 no.1
• /
• pp.181-193
• /
• 1997

The enumeration of various classes of paths in the real plane has an important implications in the area of combinatorics wit statistical applications. In 1887, D. Andre [3, pp. 21] first solved the famous ballot problem, formulated by Berttand [2], by using the well-known reflection principle which contributed tremendously to resolve the problems of enumeration of various classes of lattice paths in the plane. First, it is necessary to state the definition of NSEW-paths in the palne which will be employed throughout the paper. From [3, 10, 11], we can find results concerning many of the basics discussed in section 1 and 2.