The higher topological complexity in digital images
Melih İs, İsmet Karaca
Abstract
Open-access reader
Melih İs, İsmet Karaca
Abstract
Open-access reader
Y. Rudyak develops the concept of the topological complexity TC(X) defined by M. Farber. We study this notion in digital images by using the fundamental properties of the digital homotopy. These properties can also be useful for the future works in some applications of algebraic topology besides topological robotics. Moreover, we show that the cohomological lower bounds for the digital topological complexity TC(X,κ) do not hold.
OpenAlex reports 9 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Y. Rudyak develops the concept of the topological complexity TC(X) defined by M. Farber. We study this notion in digital images by using the fundamental properties of the digital homotopy. These properties can also be useful for the future works in some applications of algebraic topology besides topological robotics. Moreover, we show that the cohomological lower bounds for the digital topological complexity TC(X,κ) do not hold.
Key concepts: Mathematics, Topological complexity, Homotopy, Topology (electrical circuits), Algebraic topology, Digital topology, Algebraic number, Digital image