# LATTICE PATH COUNTING IN A BOUNDED PLANE

• Park, H.G. ;
• Yoon, D.S. ;
• Park, S.H.
• Published : 1997.02.01
• 33 4

#### Abstract

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.

#### Keywords

ballot number;Catalan number;dyck language;dyck path;lattice path

#### References

1. Dimension-changing bijections, reflections, and lattice paths R. K. Guy;G. Krattenthaler;B. E. Sagan
2. Ars Combin. v.25 A correction for a lattice path counting formula D. W. Detemple;C. H. Jones;J. M. Robertson
3. I.N.R.I.A., Rapports de Recherche v.518 The evolution of two stacks in bounded space and random walks in a triangle P. Flajolet
4. L. N. Math. v.1234 Chemins sous-diagonaux at tableaux de Young, Colloque de Combinatoire Enumerative Montreal, UQAM Juin 1985 D. Gouyou-Beauchamps
5. Lattice path counting and applications S. G. Mohanty
6. C. R. Acad. Sci. Paris v.105 Solution d'un probleme T. Bertrand
7. Denombrements de chemins dans $R^m$ soumis a contraintes v.29 D. Arques
8. Ars Combin. v.17 Equally likely fixed length paths in graphs D. W. Detemple;J. M. Robertson