Discrete Topological Complexities of Simplical Maps
Melih İs, İsmet Karaca
Abstract
In this study, we delve into the discrete TC of surjective simplicial fibrations, aiming to unravel the interplay between topological complexity, discrete geometric structures, and computational efficiency. Moreover, we examine the properties of the discrete TC number in higher dimensions and its relationship with scat. We also touch on the basic properties of the notion of higher contiguity distance, and show that it is possible to consider discrete TC computations in a simpler sense.
