|
|
COMMENTS
|
Number of walks in 4-dimensions using steps (1,0,0,0), (0,1,0,0), (0,0,1,0) and (0,0,0,1) from (0,0,0,0) to (n,n,n,n) such that after each step we have y>=x. Number of possible necklaces consisting of n white beads, n-1 red beads, n-1 green beads, and n-1 blue beads, where two necklaces are considered equivalent if they differ by a cyclic permutation.
Note: the generalizations of this formula and the relation between d-dimensional walks and d-colored necklaces are also true for all d, d>=5.
|
