Counting Lattice Paths By Gessel Pairs

Simple item page
dc.creatorXin, Guoce
dc.date2004-09-15
dc.date.accessioned2026-07-07T05:12:07Z
dc.date.available2026-07-07T05:12:07Z
dc.descriptionWe 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é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élou.
dc.description12 pages
dc.identifierhttps://arxiv.org/abs/math/0409238
dc.identifierhttp://arxiv.org/abs/math/0409238
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/72470
dc.subjectCombinatorics
dc.subjectProbability
dc.subject05A15 (primary) 30B10, 82A67 (secondary)
dc.titleCounting Lattice Paths By Gessel Pairs
dc.typetext

Files

Collections

arXiv