Counting Lattice Paths By Gessel Pairs
Abstract
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\'elou 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\'elou.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.