A probabilistic method for lattice path enumeration

From MaRDI portal
Publication:1081604

DOI10.1016/0378-3758(86)90009-1zbMath0602.05006OpenAlexW2079699338MaRDI QIDQ1081604

Ira M. Gessel

Publication date: 1986

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0378-3758(86)90009-1




Related Items (31)

Walks confined in a quadrant are not always D-finiteBijective counting of Kreweras walks and loopless triangulationsCounting quadrant walks via Tutte's invariant methodAn elementary solution of Gessel's walks in the quadrantWeighted lattice walks and universality classesOn the functions counting walks with small steps in the quarter planePercolation on Triangulations: A Bijective Path to Liouville Quantum GravityCounting walks in a quadrant: a unified approach via boundary value problemsExtension of certain types of generating relationsThe quasi-holonomic ansatz and restricted lattice walksSize of downsets in the pushing order and a problem of BerlekampOn 3-dimensional lattice walks confined to the positive octantRandom walks with absorbing pointsLattice path counting and the theory of queuesA history and a survey of lattice path enumerationThe complete generating function for Gessel walks is algebraicWalks in the quarter plane: Kreweras' algebraic modelPromotion of Kreweras wordsCounting quadrant walks via Tutte's invariant method (extended abstract)Hypergeometric expressions for generating functions of walks with small steps in the quarter planeCounting walks with large steps in an orthantClassifying lattice walks restricted to the quarter planeSquare lattice walks avoiding a quadrantLattice and Schröder paths with periodic boundariesPromotion of Kreweras wordsExchange relations, Dyck paths and copolymer adsorptionExact solution of some quarter plane walks with interacting boundariesHigher Dimensional Lattice Walks: Connecting Combinatorial and Analytic BehaviorAdsorbing staircase walks and staircase polygonsSize of Downsets in the Pushing Order and a Problem of BerlekampLattice paths not touching a given boundary



Cites Work


This page was built for publication: A probabilistic method for lattice path enumeration