2000 character limit reached
Discrete Topological complexity
Published 9 Jun 2017 in math.AT | (1706.02894v1)
Abstract: We introduce a notion of discrete topological complexity in the setting of simplicial complexes, using only the combinatorial structure of the complex by means of the concept of contiguous simplicial maps. We study the links of this new invariant with those of simplicial and topological LS-category.
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.