2000 character limit reached
Certain topological methods for computing digital topological complexity
Published 28 Feb 2021 in math.AT | (2103.00468v1)
Abstract: In this paper, we examine the relations of two closely related concepts, the digital Lusternik-Schnirelmann category and the digital higher topological complexity, with each other in digital images. For some certain digital images, we introduce $\kappa-$topological groups in the digital topological manner for having stronger ideas about the digital higher topological complexity. Our aim is to improve the understanding of the digital higher topological complexity. We present examples and counterexamples for $\kappa-$topological groups.
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.