Combinatorics of lattice paths with and without spikes

Details Combinatorics of lattice paths with and without spikes Combinatorics of lattice paths with and without spikes

1999-03-28

arxiv.org/abs/hep-lat/9903037v1

J.Phys.A33:1017-1030,2000

Physics

High Energy Physics

High Energy Physics - Lattice

Latex. 25 pages

Scientific paper

10.1088/0305-4470/33/5/314

We derive a series of results on random walks on a d-dimensional hypercubic lattice (lattice paths). We introduce the notions of terse and simple paths corresponding to the path having no backtracking parts (spikes). These paths label equivalence classes which allow a rearrangement of the sum over paths. The basic combinatorial quantities of this construction are given. These formulas are useful when performing strong coupling (hopping parameter) expansions of lattice models. Some applications are described.

Affiliated with

Also associated with

No associations

Rating

Combinatorics of lattice paths with and without spikes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Combinatorics of lattice paths with and without spikes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Combinatorics of lattice paths with and without spikes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-303037