Lattice paths: Vicious walkers and friendly walkers

Journal of Statistical Planning and Inference

Volumn 101, Issue 1-2, 2002, Pages 107-131

  Guttmann, Anthony J ^a   Vöge, Markus ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Directed paths; Lattice paths; Osculating walkers; Vertex model; Vicious walkers

Indexed keywords

EID: 0037082906     PISSN: 03783758     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0378-3758(01)00158-6     Document Type: Article

References (19)

1. The inversion relation method for some two-dimensional exactly solved models in lattice statistics
2. A method for the enumeration of various classes of column-convex polygons
3. Inversion Relations, Reciprocity and Polyominoes
4. Square lattice self-avoiding walks and corrections to scaling
5. Vicious walkers and directed polymer networks in general dimensions
6. Walks, walls, wetting, and melting
7. Binomial determinants, paths, and hook length formulae
8. A proof of the Bender-Knuth conjecture
9. Indicators of solvability for lattice models
10. Vicious Walkers and Young Tableaux II: With walls
11. Vicious Walkers and Young Tableaux I: Without walls
12. Coincidence probabilities
13. On the vector representations of induced Matroids
14. The Inversion Relation
15. Crystal statistics. I. A two-dimensional model with an order-disorder transition
16. GFUN: A Maple Package for the Manipulation of Generating and Holonomic Functions in One Variable