Related papers: Towards Directed Collapsibility
Models of discrete space and space-time that exhibit continuum-like behavior at large lengths could have profound implications for physics. They may tame the infinities that arise from quantizing gravity, and dispense with the machinery of…
The concept of typed topological space is introduced, for which open sets in a topology on a finite set will be assigned types (from lattice). The neighborhood system of a point, the closure and the connectedness can be defined according to…
Given a trivalent graph in the 3-dimensional Euclidean space, we call it a discrete surface because it has a tangent space at each vertex determined by its neighbor vertices. To abstract a continuum object hidden in the discrete surface, we…
Algebraic topological methods have been used successfully in concurrency theory, the domain of theoretical computer science that deals with distributed computing. L. Fajstrup, E. Goubault, and M. Raussen have introduced partially ordered…
In this short note, we argue that directed homotopy can be given the structure of generalized modules, over particular monoids. This is part of a general attempt for refoundation of directed topology.
A `discrete differential manifold' we call a countable set together with an algebraic differential calculus on it. This structure has already been explored in previous work and provides us with a convenient framework for the formulation of…
In this paper, we investigate discrete topological complexity $TC(K)$ introduced for situations where the configuration space possesses a simplicial structure. %Simplicial complexes are well-known and commonly used in programming for…
For multidimensional Euclidean type spaces, we study convex choice: from any choice set, the set of types that make the same choice is convex. We establish that, in a suitable sense, this property characterizes the sufficiency of local…
Embedding undirected graphs in a Euclidean space has many computational benefits. FastMap is an efficient embedding algorithm that facilitates a geometric interpretation of problems posed on undirected graphs. However, Euclidean distances…
A reparametrization (of a continuous path) is given by a surjective weakly increasing self-map of the unit interval. We show that the monoid of reparametrizations (with respect to compositions) can be understood via ``stop-maps'' that allow…
In this paper, we introduce the notions of stable future, past and total component systems on a directed space with no loops. Then, we associate the stable component category to a stable (future, past or total) component system. Stable…
We develop a new concept of non-positive curvature for metric spaces, based on intersection patterns of closed balls. In contrast to the synthetic approaches of Alexandrov and Buesemann, our concept also applies to metric spaces that might…
We give a short proof of the contractibility of the space of geodesic triangulations with fixed combinatorial type of a convex polygon in the Euclidean plane. Moreover, for any $n>0$, we show that there exists a space of geodesic…
Many concrete problems are formulated in terms of a finite set of points in $R^n$ which, via the ambient Euclidean metric, becomes a finite metric space. To obtain information from such a space, it is often useful to associate a graph to…
In this paper, we introduce canonical principal direction (CPD) submanifolds with higher codimension in Euclidean spaces. We obtain the complete classification of surfaces endowed with CPD in the Euclidean 4-space.
The concept of $typed$ $topology$ is introduced. In a typed topological space, some open sets are assigned "types", and topological concepts such as closure, connectedness can be defined using types. A finite data set in $R^2$ is a…
Directed graphs can be studied by their associated directed flag complex. The homology of this complex has been successful in applications as a topological invariant for digraphs. Through comparison with path homology theory, we derive a…
We apply the theory of directed topology developed by Grandis [9, 10] to the study of stratified spaces by describing several ways in which a stratification or a stratification with orientations on the strata can be used to produce a…
The paper is concerned with elongating the shortest curvature-bounded path between two oriented points to an expected length. The elongation of curvature-bounded paths to an expected length is fundamentally important to plan missions for…
In this short note we observe that the higher topological complexity of an iterated connected sum of real projective spaces is maximal possible. Unlike the case of regular TC, the result is accessible through easy mod 2 zero-divisor…