The theory of topological complexity is an important theory in the study of motion planning problems. Over the last decade, several attempts have been made to extend the theory of complexity (and its higher analogues) to proximal and digital topological settings. As a result, there are now digital versions of concepts like path spaces, motion planning algorithms, the Schwarz genus, the homotopic distance, digital fibrations, digital topological groups, and generalized topological complexity. Despite the number of publications on the topic of digital and proximal topological complexity, several mathematical issues within the area have yet to be resolved. For example, the theory of classical topological complexity suggests the construction of path spaces, product adjacencies, continuous maps, homotopy structures, lifting structures, and fibrations. Each of these concepts inherently relates to the notion of topology, which is a concept that applies to digital spaces only in a restricted manner. As a result, each of these concepts must be defined within digital spaces, and their mathematical consistency within those spaces must be established. In this paper, a collection of existing publications on the topic of proximal and digital topological complexity will be reviewed. Each of these publications has encountered issues related to adjacency structures, digital continuity, path spaces, digital fibrations, and generalized complexity. A focus will be placed upon the role that product adjacencies, digital coverings, the unique path lifting property, and the homotopy lifting property play in the definition of digital analogues of concepts from classical topology. Overall, while the current state of the known results related to digital and proximal topological complexity can be summarized, several challenges must be overcome in developing future results on the topic. Suggestions for future research in the field will be made and suggested challenges will be discussed. Specifically, it is clear from the published results that a theory based upon adjacencies in digital spaces is needed, as well as established results regarding digital continuity, digital covering maps, and lifting structures.
References
[1]
Farber, M. (2003) Topological Complexity of Motion Planning. DiscreteandComputationalGeometry, 29, 211-221. https://doi.org/10.1007/s00454-002-0760-9
[2]
Rudyak, Y.B. (2010) On Higher Analogs of Topological Complexity. TopologyandItsApplications, 157, 916-920. https://doi.org/10.1016/j.topol.2009.12.007
[3]
Grant, M. (2012) Topological Complexity, Fibrations and Symmetry. TopologyandItsApplications, 159, 88-97. https://doi.org/10.1016/j.topol.2011.07.025
[4]
González, J. and Grant, M. (2015) Sequential Motion Planning of Non-Colliding Particles in Euclidean Spaces. ProceedingsoftheAmericanMathematicalSociety, 143, 4503-4512. https://doi.org/10.1090/proc/12443
[5]
Pave?i?, P. (2019) Topological Complexity of a Map. Homology, HomotopyandApplications, 21, 107-130. https://doi.org/10.4310/hha.2019.v21.n2.a7
[6]
Boxer, L. (1994) Digitally Continuous Functions. PatternRecognitionLetters, 15, 833-839. https://doi.org/10.1016/0167-8655(94)90012-4
[7]
Boxer, L. (1999) A Classical Construction for the Digital Fundamental Group. JournalofMathematicalImagingandVision, 10, 51-62. https://doi.org/10.1023/a:1008370600456
[8]
Boxer, L. (2005) Properties of Digital Homotopy. JournalofMathematicalImagingandVision, 22, 19-26. https://doi.org/10.1007/s10851-005-4780-y
[9]
Han, S. (2025) Digital Covering Spaces, Pseudo Covering Spaces, and Related Works. Discrete Mathematics, Algorithms and Applications, 18, Article ID: 2550034. https://doi.org/10.1142/s179383092550034x
[10]
Han, S. (2005) Non-Product Property of the Digital Fundamental Group. InformationSciences, 171, 73-91. https://doi.org/10.1016/j.ins.2004.03.018
[11]
Han, S.E. (2005) Digital Coverings and Their Applications. Journal of Applied Mathematics and Informatics, 18, 487-495.
[12]
Han, S. (2022) Digitally Topological Groups. ElectronicResearchArchive, 30, 2356-2384. https://doi.org/10.3934/era.2022120
[13]
Lupton, G., Oprea, J. and Scoville, N.A. (2022) Homotopy Theory in Digital Topology. Discrete&ComputationalGeometry, 67, 112-165. https://doi.org/10.1007/s00454-021-00336-x
[14]
Boxer, L. and Staecker, P.C. (2017) Homotopy Relations for Digital Images. Note di Matematica, 37, 99-126.
[15]
Boxer, L. (2017) Generalized Normal Product Adjacency in Digital Topology. AppliedGeneralTopology, 18, 401-427. https://doi.org/10.4995/agt.2017.7798
[16]
Boxer, L. (2018) Alternate Product Adjacencies in Digital Topology. AppliedGeneralTopology, 19, 21-53. https://doi.org/10.4995/agt.2018.7146
[17]
?s, M. (2024) Topological Group Construction in Proximity and Descriptive Proximity Spaces. TurkishJournalofMathematicsandComputerScience, 16, 206-216. https://doi.org/10.47000/tjmcs.1333562
[18]
?s, M. (2025) Some Notes and Comparisons on Topological Complexities. MediterraneanJournalofMathematics, 22, Article No. 140. https://doi.org/10.1007/s00009-025-02908-0
[19]
?s, M. and Karaca, ?. (2025) Proximal Motion Planning Algorithms. AppliedGeneralTopology, 26, 131-162. https://doi.org/10.4995/agt.2025.21183
[20]
?s, M. and Karaca, ?. (2025) Digital Topological Complexity of Digital Maps. Journal of the International Mathematical Virtual Institute, 15, 139-158.
[21]
?s, M. and Karaca, ?. (2024) Some Properties of Proximal Homotopy Theory. Filomat, 38, 3137-3156. https://doi.org/10.2298/fil2409137i
[22]
?s, M. and Karaca, ?. (2024) Discrete Topological Complexities of Simplicial Maps. Journal of Linear and Topological Algebra, 13, 121-135.
[23]
?s, M. and Karaca, ?. (2023) Different Types of Topological Complexity Based on Higher Homotopic Distance. TopologyandItsApplications, 337, Article ID: 108630. https://doi.org/10.1016/j.topol.2023.108630
[24]
?s, M. and Karaca, ?. (2023) Certain Topological Methods for Computing Digital Topological Complexity. Korean Journal of Mathematics, 31, 1-16.
[25]
?s, M. and Karaca, ?. (2022) Higher Topological Complexity for Fibrations. Filomat, 36, 6885-6896. https://doi.org/10.2298/fil2220885i
[26]
?s, M. and Karaca, ?. (2022) Counterexamples for Topological Complexity in Digital Images. Journal of the International Mathematical Virtual Institute, 12, 103-121.
[27]
?s, M. and Karaca, ?. (2022) Topological Complexities of Finite Digital Images. Journal of Linear and Topological Algebra, 11, 55-68.
[28]
?s, M. and Karaca, ?. (2020) The Higher Topological Complexity in Digital Images. AppliedGeneralTopology, 21, 305-325. https://doi.org/10.4995/agt.2020.13553
[29]
Karaca, ?. and Is, M. (2018) Digital Topological Complexity Numbers. TurkishJournalofMathematics, 42, 3173-3181. https://doi.org/10.3906/mat-1807-101