Counting walks in a quadrant: a unified approach via boundary value problems
Publication:2428717
DOI10.4171/JEMS/317zbMath1238.05014arXiv1003.1362MaRDI QIDQ2428717
Publication date: 20 April 2012
Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1003.1362
conformal mappinguniformizationboundary value problemRiemann surfaceWeierstrass elliptic functionlattice walkcounting generating function
Sums of independent random variables; random walks (60G50) Exact enumeration problems, generating functions (05A15) Compact Riemann surfaces and uniformization (30F10) Functional equations in the complex plane, iteration and composition of analytic functions of one complex variable (30D05)
Related Items (32)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Walks in the quarter plane: Kreweras' algebraic model
- Green functions and Martin compactification for killed random walks related to \(SU(3)\)
- Explicit expression for the generating function counting Gessel's walks
- Two non-holonomic lattice walks in the quarter plane
- A probabilistic method for lattice path enumeration
- Walks confined in a quadrant are not always D-finite
- Green functions for killed random walks in the Weyl chamber of \(\mathrm{Sp}(4)\)
- Random walks in $(\mathbb{Z}_{+})^{2}$ with non-zero drift absorbed at the axes
- Walks with small steps in the quarter plane
- Proof of Ira Gessel's lattice path conjecture
- On the Holonomy or Algebraicity of Generating Functions Counting Lattice Walks in the Quarter-Plane
- Automatic Classification of Restricted Lattice Walks
- Two Parallel Queues Created by Arrivals with Two Demands I
- Crossings and nestings of matchings and partitions
- Two Parallel Queues Created by Arrivals with Two Demands II
- The Compensation Approach for Walks With Small Steps in the Quarter Plane
- The complete generating function for Gessel walks is algebraic
This page was built for publication: Counting walks in a quadrant: a unified approach via boundary value problems