Counting Lattice Paths By Gessel Pairs

Details Counting Lattice Paths By Gessel Pairs Counting Lattice Paths By Gessel Pairs

2004-09-15

arxiv.org/abs/math/0409238v1

Mathematics

Combinatorics

12 pages

Scientific paper

We count a large class of lattice paths by using factorizations of free monoids. Besides the classical lattice paths counting problems related to Catalan numbers, we give a new approach to the problem of counting walks on the slit plane (walks avoid a half line) that was first solved by Bousquet-M\'{e}lou and Schaeffer. We also solve a problem about walks in the half plane avoiding a half line by subsequently applying the factorizations of two different Gessel pairs, giving a generalization of a result of Bousquet-M\'{e}lou.

Affiliated with

Also associated with

No associations

Rating

Counting Lattice Paths By Gessel Pairs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Counting Lattice Paths By Gessel Pairs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting Lattice Paths By Gessel Pairs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-621791