Three friendly walkers
From MaRDI portal
Abstract: More than 15 years ago Guttmann and V"oge [J. Statist. Plann. Inference, {�f 101}, 107 (2002)], introduced a model of friendly walkers. Since then it has remained unsolved. In this paper we provide the exact solution to a closely allied model, originally introduced by Tsuchiya and Katori [J. Phys. Soc. Japan {�f 67}, 1655 (1988)], which essentially only differs in the boundary conditions. The exact solution is expressed in terms of the reciprocal of the generating function for vicious walkers which is a D-finite function. However, ratios of D-finite functions are inherently not D-finite and in this case we prove that the friendly walkers generating function is the solution to a non-linear differential equation with polynomial coefficients, it is in other words D-algebraic. We then show via numerically exact calculations that the generating function of the original model can also be expressed as a D-finite function times the reciprocal of the generating function for vicious walkers. We obtain an expression for this D-finite function in terms of a hypergeometric function with a rational pullback and its first and second derivatives.
Recommendations
- Lattice paths: Vicious walkers and friendly walkers
- Vicious walkers, friendly walkers and Young tableaux. II: With a wall
- Hypergeometric expressions for generating functions of walks with small steps in the quarter plane
- Vicious walkers, friendly walkers, and Young tableaux. III: Between two walls
- Integrable models for vicious and friendly walkers
Cites work
- A collapse transition in a directed walk model
- An exact solution of three interacting friendly walks in the bulk
- Constant term solution for an arbitrary number of osculating lattice paths
- Determinants of super-Schur functions, lattice paths, and dotted plane partitions
- Exact enumeration of parallel walks on directed lattices
- Fuchsian differential equations from modular arithmetic
- scientific article; zbMATH DE number 820679 (Why is no real title available?)
- Lattice paths: Vicious walkers and friendly walkers
- Nonintersecting paths, pfaffians, and plane partitions
- Square lattice self-avoiding walks and biased differential approximants
- The perimeter generating functions of three-choice, imperfect, and one-punctured staircase polygons
- The reciprocals of solutions of linear ordinary differential equations
- Vicious walkers and Young tableaux I: without walls
- Vicious walkers, friendly walkers and Young tableaux. II: With a wall
- Vicious walkers, friendly walkers, and Young tableaux. III: Between two walls
- Walks, walls, wetting, and melting
Cited in
(3)
This page was built for publication: Three friendly walkers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958581)