Indonesian Journal of Combinatorics
Vol 7, No 2 (2023)

4-Dimensional Lattice Path Enumeration with Arbitrary Steps

Vural, Alper (Department of Mathematics, Beşiktaş Science and Art Center)
Karaçam, Cemil (Department of Mathematics, Yıldız Technical University)

Article Info

Publish Date
30 Dec 2023

Abstract

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.

Copyrights © 2023




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
Indonesian Journal of Combinatorics
Website

Abbrev

ijc

Publisher

Indonesian Combinatorial Society

Subject

Computer Science & IT Decision Sciences, Operations Research & Management

Description

Indonesian Journal of Combinatorics (IJC) publishes current research articles in any area of combinatorics and graph theory such as graph labelings, optimal network problems, metric dimension, graph coloring, rainbow connection and other related topics. IJC is published by the Indonesian ...