Related papers: Contiguity Distance between Simplicial Maps
In this paper, we systematically develop the $m$-contiguity distance between simplicial maps as a discrete approximation framework for homotopical complexity in the category of simplicial complexes. We construct an increasing sequence of…
We introduce two new algebraic invariants, the (co)homological distances between continuous maps, which provide computable lower bounds for the homotopic distance and strictly refine the classical cup-length estimates. We then define the…
In this paper, we introduce the higher analogues of contiguity distance and its relations with simplicial Lusternik-Schnirelmann category and discrete topological complexity. Also we study the effects of geometric realisation and…
We show that both Lusternik-Schnirelmann category and topological complexity are particular cases of a more general notion, that we call homotopic distance between two maps. As a consequence, several properties of those invariants can be…
In this paper we will introduce and give topological properties of a new concept named simplicial distance which is the simplicial analog of the homotopic distance (in the sense of Marcias-Virgos and Mosquera-Lois in their paper [6]).…
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…
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…
In this paper, we introduce relative LS category of a map and study some of its properties. Then we introduce `higher topological complexity' of a map, a homotopy invariant. We give a cohomological lower bound and compare it with previously…
In this study, we improve the topological complexity computations on digital images with introducing the digital topological complexity computations of a surjective and digitally continuous map between digital images. We also reveal…
In this paper, we study three relative LS categories of a map and study some of their properties. Then we introduce the `higher topological complexity' and `weak higher topological complexity' of a map. Each of them are homotopy invariants.…
In this paper, we study the Lusternik-Schnirelmann category of a simplicial map between simplicial complexes, generalizing the simplicial category of a complex to that of a map. Several properties of this new invariant are shown, including…
We study the degrees of homogeneous harmonic maps between simplicial cones. Such maps have been used to model the local behavior of harmonic maps between singular spaces, where the degrees of homogeneous approximations describe the…
Many practical applications in topological data analysis arise from data in the form of point clouds, which then yield simplicial complexes. The combinatorial structure of simplicial complexes captures the topological relationships between…
We give an overview of different approaches to measuring the similarity of, or the distance between, two graphs, highlighting connections between these approaches. We also discuss the complexity of computing the distances.
Using the notion of contiguity of simplicial maps, we adapt Farber's topological complexity to the realm of simplicial complexes. We show that, for a finite simplicial complex $K$, our discretized concept recovers the topological complexity…
This paper lays the foundations of an approach to applying Gromov's ideas on quantitative topology to topological data analysis. We introduce the "contiguity complex", a simplicial complex of maps between simplicial complexes defined in…
In many scientific and technological contexts we have only a poor understanding of the structure and details of appropriate mathematical models. We often, therefore, need to compare different models. With available data we can use formal…
In this paper we introduce a path complex that can be regarded as a generalization of the notion of a simplicial complex. The main motivation for considering path complexes comes from directed graphs(digraphs). We obtain a new notion of the…
This paper introduces a model that identifies spatial relationships for a structural analysis based on the concept of simplicial complex. The spatial relationships are identified through overlapping two map layers, namely a primary layer…
We present a bisimulation relation for neighbourhood spaces, a generalisation of topological spaces. We show that this notion, path preserving bisimulation, preserves formulas of the spatial logic SLCS. We then use this preservation result…