In combinatorics, a lattice path L in the d-dimensional integer lattice Z d of length k with steps in the set S, is a sequence of vectors v 0, v 1, …, v k ∈ Z d such that each consecutive difference v
Superimposed sets of NE lattice paths squared. All NE lattice paths are accounted for.