4-Dimensional Lattice Path Enumeration with Arbitrary Steps

Alper Vural, Cemil Karaçam


Consider a set of vectors, L, which consists of vectors whose coordinates are 0 or 1. We find explicit formulas that counts the number of lattice paths from origin to (a,b,c,d) for using vectors in {(1,0,0,0),(0,1,0,0),(0,0,1,0),(0,0,0,1)} ∪ L for various choices of L. In some cases we also give the recursive formulas for the same problem. Next we determine the minimum number of vectors that must be used to reach (a,b,c,d), also called the minimum distance problem, for different sets of vectors.


Lattice Path, Shortest Path, 4 Dimensions

Full Text:


DOI: http://dx.doi.org/10.19184/ijc.2023.7.2.1


F. Bennet, Lattice Paths in Diagonals and Dimensions(Honor Thesis). retrived from:digitalcommons.coastal.edu,(2020).

J. Evoniuk, S. Klee, and V. Magnan, Enumerating minimal length lattice paths, J.Integer Sequences, 21 (2018), Article 18.3.6.

K. Humphreys, A history and a survey of lattice path enumeration, J. Statistical Planning and Inference, 140(9), 2010), 2237-2254.

N. Iwanojko, S. Klee, B. Lasher, and E. Volpi, Enumerating lattice walks with prescribed steps, J. Integer Sequences, 23 (2020), Article 20.4.3.

C. Krattenthaler, Lattice path enumeration, arXiv preprint arXiv:1503.05930, 2015).


  • There are currently no refbacks.

ISSN: 2541-2205

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

View IJC Stats