Lattice paths: Vicious walkers and friendly walkers

DOI10.1016/S0378-3758(01)00158-6zbMath0993.05007OpenAlexW2068724900WikidataQ67579211 ScholiaQ67579211MaRDI QIDQ1347970

Markus Vöge, Anthony J. Guttmann

Publication date: 15 May 2002

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

Full work available at URL: https://doi.org/10.1016/s0378-3758(01)00158-6

zbMATH Keywords

lattice pathsfriendly walkersGessel-Viennot theoremplanar configurationsvicious walker

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Related Items (4)

Three friendly walkers ⋮ A history and a survey of lattice path enumeration ⋮ On three and four vicious walkers ⋮ The Kubelka–Munk model and Dyck paths

Uses Software

• gfun

Cites Work

• Unnamed Item
• Unnamed Item
• Coincidence probabilities
• A proof of the Bender-Knuth conjecture
• Binomial determinants, paths, and hook length formulae
• Walks, walls, wetting, and melting
• Inversion relations, reciprocity and polyominoes
• A method for the enumeration of various classes of column-convex polygons
• Indicators of solvability for lattice models
• Vicious walkers, friendly walkers and Young tableaux: II. With a wall
• Vicious walkers and Young tableaux I: without walls
• GFUN
• On the Vector Representations of Induced Matroids
• Crystal Statistics. I. A Two-Dimensional Model with an Order-Disorder Transition

This page was built for publication: Lattice paths: Vicious walkers and friendly walkers