Related papers: Concurrent Process up to Homotopy (I)
Persistent homology is a popular and powerful tool for capturing topological features of data. Advances in algorithms for computing persistent homology have reduced the computation time drastically -- as long as the algorithm does not…
We construct a stable infinity category with objects flow categories and morphisms flow bimodules; our construction has many flavors, related to a choice of bordism theory, and we discuss in particular framed bordism and the bordism theory…
We have recently defined a weak Markovian bisimulation equivalence in an integrated-time setting, which reduces sequences of exponentially timed internal actions to individual exponentially timed internal actions having the same average…
The ability of Flow Matching (FM) to model complex conditional distributions has established it as the state-of-the-art for prediction tasks (e.g., robotics, weather forecasting). However, deployment in safety-critical settings is hindered…
Continuous Dynamic Time Warping (CDTW) measures the similarity of polygonal curves robustly to outliers and to sampling rates, but the design and analysis of CDTW algorithms face multiple challenges. We show that CDTW cannot be computed…
For a 1-connected CW-complex $X$, let $\mathcal{E}(X)$ denote the group of homotopy classes of self-homotopy equivalences of $X$. The aim of this paper is to prove that, for every $n\in\Bbb N$, there exists a 1-connected rational CW-complex…
A finite connected CW complex which is a co-H-space is shown to have the homotopy type of a wedge of a bunch of circles and a simply-connected finite complex after almost $p$-completion at a prime $p$.
Computational topology is an area that revisits topological problems from an algorithmic point of view, and develops topological tools for improved algorithms. We survey results in computational topology that are concerned with graphs drawn…
The Dowker theorem is a classical result in the topology of finite spaces, claiming that any binary relation between two finite spaces defines two homotopy-equivalent complexes (the Dowker complexes). Recently, Barmak strengthened this to a…
Let $K$ be an arbitrary semi-cubical set that can be embedded in a standard cube. Using Discrete Morse Theory, we construct a CW-complex that is homotopy equivalent to the space $\vec{P}(K)_v^w$ of directed paths between two given vertices…
Persistent homology enables fast and computable comparison of topological objects. However, it is naturally limited to the analysis of topological spaces. We extend the theory of persistence, by guaranteeing robustness and computability to…
A semi-process is an analog of the semi-flow for non-autonomous differential equations or inclusions. We prove an abstract result on the existence of measurable semi-processes in the situations where there is no uniqueness. Also, we allow…
In this paper we investigate how to simultaneously change homotopy algebras of a certain type and a corresponding infinity morphism between them, and show that this can be done in a homotopically unique way. More precisely, for a reduced…
An explicit isomorphism between Morse homology and singular homology is constructed via the technique of pseudo-cycles. Given a Morse cycle as a formal sum of critical points of a Morse function, the unstable manifolds for the negative…
We report the quantum computing of reacting flows by simulating the Hamiltonian dynamics. The scalar transport equation for reacting flows is transformed into a Hamiltonian system, mapping the dissipative and non-Hermitian problem in…
Currently there is great interest in computational models consisting of underlying regular computational environments, and built on them distributed computational structures. Examples of such models are cellular automata, spatial…
We use a vector field flow defined through a cubulation of a closed manifold to reconcile the partially defined commutative product on geometric cochains with the standard cup product on cubical cochains, which is fully defined and…
Computational topology is a vibrant contemporary subfield and this article integrates knot theory and mathematical visualization. Previous work on computer graphics developed a sequence of smooth knots that were shown to converge point wise…
Drawing on an analogy with the second law of thermodynamics for adiabatically isolated systems, Cover argued that data-processing inequalities may be seen as second laws for "computationally isolated systems," namely, systems evolving…
Numerical continuation methods track a solution path defined by a homotopy. The systems we consider are defined by polynomials in several variables with complex coefficients. For larger dimensions and degrees, the numerical conditioning…