Skip to main content

All Questions

1 question with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
0 votes
0 answers
119 views

the enumeration of 2 dimensional lattice walks with fixed number steps and largest distance from the end point ti the origin

There is actually an one dimensional version of this problem. For each step of the lattice walk, we can move either east for one unit or west for one unit. The problem is that given a fixed $n$ steps ...
Mclalalala's user avatar