2000 character limit reached
Discrete Topological Complexities of Simplical Maps
Published 9 Mar 2024 in math.AT | (2403.05835v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.