Related papers: A calculus for flow categories
In this paper, a G-shift of finite type (G-SFT) is a shift of finite type together with a free continuous shift-commuting action by a finite group G. We reduce the classification of G-SFTs up to equivariant flow equivalence to an algebraic…
Modular flow is a symmetry of the algebra of observables associated to spacetime regions. Being closely related to entanglement, it has played a key role in recent connections between information theory, QFT and gravity. However, little is…
Mainstream flow matching methods typically focus on learning the local velocity field, which inherently requires multiple integration steps during generation. In contrast, Mean Velocity Flow models establish a relationship between the local…
We study several one dimensional step flow models. Numerical simulations show that the slope of the profile exhibits scaling in all cases. We apply a scaling ansatz to the various step flow models and investigate their long time evolution.…
We define a simpler notion of symmetric topological complexity more ad hoc to the motion planning problem which was the original motivation for the definition of topological complexity. This is a homotopy invariant that we call…
We develop a localisation theory for certain categories, yielding a 3-arrow calculus: Every morphism in the localisation is represented by a diagram of length 3, and two such diagrams represent the same morphism if and only if they can be…
Trapping and manipulation of small particles underlies many scientific and technological applications. Recently, the precise manipulation of multiple small particles was demonstrated using a Stokes trap that relies only on fluid flow…
We consider two classes of stream-based computations which admit taking linear combinations of execution runs: probabilistic sampling and generalized animation. The dataflow architecture is a natural platform for programming with streams.…
A number-conserving cellular automaton is a simplified model for a system of interacting particles. This paper contains two related constructions by which one can find all one-dimensional number-conserving cellular automata with one kind of…
Particles moving inside a fluid near, and interacting with, invariant manifolds is a common phenomenon in a wide variety of applications. One elementary question is whether we can determine once a particle has entered a neighbourhood of an…
State estimation for nonlinear systems, especially in high dimensions, is a generally intractable problem, despite the ever-increasing computing power. Efficient algorithms usually apply a finite-dimensional model for approximating the…
The goal of this article is to prove the comparison theorem between algebraic and topological nearby cycles of a morphism without slopes. We prove in particular that for a family of holomorphic functions without slopes, if we iterate…
Fixed-point (FP) lattice actions are classically perfect, i.e., they have continuum classical properties unaffected by discretization effects and are expected to have suppressed lattice artifacts at weak coupling. Therefore they provide a…
A four-parameter kinematic model for the position of a fluid parcel in a time-varying ellipse is introduced. For any ellipse advected by an arbitrary linear two-dimensional flow, the rates of change of the ellipse parameters are uniquely…
The equation of motion of a general class of macroscopic traffic flow models is linearized around a steady uniform flow. A closed-form solution of a boundary-initial value problem is obtained, and it is used to describe several phenomena.…
The flow of viscous fluids is considered as the aggregation of the motion of fluid particles when the fluid is conceived to be made up by an infinite number of particles. As an alternative of this conventional model, fluid motion could be…
The Fischer, Krieger, and fiber product covers of sofic beta-shifts are constructed and used to show that every strictly sofic beta-shift is $2$-sofic. Flow invariants based on the covers are computed, and shown to only depend on an single…
Convection is a well-studied topic in fluid dynamics, yet it is less understood in the context of networks flows. Here, we incorporate techniques from topological data analysis (namely, persistent homology) to automate the detection and…
The relation between flow and density is an essential quantitative characteristic to describe the efficiency of traffic systems. We have performed experiments with single-file motion of bicycles and compare the results with previous studies…
This paper proposes a scalable lattice-Boltzmann computational framework (SBoTFlow) for simulations of flexible moving objects in an incompressible fluid flow. Behavior of fluid flow formed from moving boundaries of flexible-object motions…