Related papers: A calculus for flow categories
Framed flow categories were introduced by Cohen-Jones-Segal as a way of encoding the flow data associated to a Floer functional. A framed flow category gives rise to a CW-complex with one cell for each object of the category. The idea is…
We pursue the analogy of a framed flow category with the flow data of a Morse function. In classical Morse theory, Morse functions can sometimes be locally altered and simplified by the Morse moves. These moves include the Whitney trick…
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 define a parabolic flow of pluriclosed metrics. This flow is of the same family introduced by the authors in \cite{ST}. We study the relationship of the existence of the flow and associated static metrics topological information on the…
Shifts of finite type defined from shift equivalent matrices must be flow equivalent.
Existing optical flow methods make generic, spatially homogeneous, assumptions about the spatial structure of the flow. In reality, optical flow varies across an image depending on object class. Simply put, different objects move…
We solve the problem of topological classification for smooth structurally stable flows on closed four-dimensional manifolds, the non-wandering set of which contains exactly two saddle equilibria, and the wandering set contains isolated…
We study two problems related to flow equivalence of shift spaces. The first problem, the classification of $S$-gap shifts up to flow equivalence, is partially solved with the establishment of a new invariant for the sofic $S$-gap shifts…
We construct a cofibrantly generated model structure on the category of flows such that any flow is fibrant and such that two cofibrant flows are homotopy equivalent for this model structure if and only if they are S-homotopy equivalent.…
A flow is homotopy continuous if it is indefinitely divisible up to S-homotopy. The full subcategory of cofibrant homotopy continuous flows has nice features. Not only it is big enough to contain all dihomotopy types, but also a morphism…
We prove that the category of flows cannot be the underlying category of a model category whose corresponding homotopy types are the flows up to weak dihomotopy. Some hints are given to overcome this problem. In particular, a new approach…
We propose categories of $1$-dimensional and multi-dimensional quantum walks. In the categories, an object is a quantum walk, and a morphism is an intertwining operator between two quantum walks. The new framework enables us to discuss…
A functor is constructed from the category of globular CW-complexes to that of flows. It allows the comparison of the S-homotopy equivalences (resp. the T-homotopy equivalences) of globular complexes with the S-homotopy equivalences (resp.…
In topological data science, categories with a flow have become ubiquitous, including as special cases examples like persistence modules and sheaves. With the flow comes an interleaving distance, which has proven useful for applications. We…
We present a new flow framework for separation logic reasoning about programs that manipulate general graphs. The framework overcomes problems in earlier developments: it is based on standard fixed point theory, guarantees least flows,…
We show that the category of graphs has the structure of a 2-category with homotopy as the 2-cells. We then develop an explicit description of homotopies for finite graphs, in terms of what we call `spider moves'. We then create a category…
The purpose of this paper is to collect the homotopical methods used in the development of the theory of flows initialized by author's paper ``A model category for the homotopy theory of concurrency''. It is presented generalizations of the…
Flows are a topological model of concurrency which enables to encode the notion of refinement of observation and to understand the homological properties of branchings and mergings of execution paths. Roughly speaking, they are Grandis'…
We give conditions for when continuous orbit equivalence of one-sided shift spaces implies flow equivalence of the associated two-sided shift spaces. Using groupoid techniques, we prove that this is always the case for shifts of finite…
Cyclomatic complexity is an incompletely specified but mathematically principled software metric that can be usefully applied to both source and binary code. We consider the application of path homology as a stronger analogue of cyclomatic…