Related papers: Open Dynamical Systems as Coalgebras for Polynomia…
We argue that operads provide a general framework for dealing with polynomials and combinatory completeness of combinatory algebras, including the classical $\mathbf{SK}$-algebras, linear $\mathbf{BCI}$-algebras, planar…
Using the theory of coalgebra, we introduce a uniform framework for adding modalities to the language of propositional geometric logic. Models for this logic are based on coalgebras for an endofunctor on some full subcategory of the…
We provide a compositional coalgebraic semantics for strategic games. In our framework, like in the semantics of functional programming languages, coalgebras represent the observable behaviour of systems derived from the behaviour of the…
We construct a symmetric monoidal closed category of polynomial endofunctors (as objects) and simulation cells (as morphisms). This structure is defined using universal properties without reference to representing polynomial diagrams and is…
Generalized span categories provide a framework for formalizing mathematical models of open systems in classical mechanics. We introduce categories $\mathsf{LagSy}$ and $\mathsf{HamSy}$ that respectively provide a categorical framework for…
We develop a new framework for the study of complex continuous time dynamical systems based on viewing them as collections of interacting control modules. This framework is inspired by and builds upon the groupoid formalism of Golubitsky,…
The basic mathematical assumptions for autonomous linear kinetic equations for a classical system are formulated, leading to the conclusion that if they are differential equations on its phase space $M$, they are at most of the 2nd order.…
Potential algebras can be used effectively in the analysis of the quantum systems. In the article, we focus on the systems described by a separable, 2x2 matrix Hamiltonian of the first order in derivatives. We find integrals of motion of…
Organizing physics has been a long-standing preoccupation of applied category theory, going back at least to Lawvere. We contribute to this research thread by noticing that Hamiltonian mechanics and gradient descent depend crucially on a…
Applied category theory often studies symmetric monoidal categories (SMCs) whose morphisms represent open systems. These structures naturally accommodate complex wiring patterns, leveraging (co)monoidal structures for splitting and merging…
Probabilistic programming is related to a compositional approach to stochastic modeling by switching from discrete to continuous time dynamics. In continuous time, an operator-algebra semantics is available in which processes proceeding in…
This paper is devoted to constructing and studying exactly solvable dynamical systems in discrete time obtained from some algebraic operations on matrices, to reductions of such systems leading to classical field theory models in…
In this paper we report a few examples of algebraically solvable dynamical systems characterized by 2 coupled Ordinary Differential Equations which read as follows: x_n = P(n) (x1, x2) , n = 1, 2 , with P(n) (x1, x2) specific polynomials of…
This paper gives two new categorical characterisations of lenses: one as a coalgebra of the store comonad, and the other as a monoidal natural transformation on a category of a certain class of coalgebras. The store comonad of the first…
In this article, we continue our study of category dynamical systems, that is functors $s$ from a category $G$ to $\Top^{\op}$, and their corresponding skew category algebras. Suppose that the spaces $s(e)$, for $e \in \ob(G)$, are compact…
The paper proposes an algorithm which could identify a general class of pdes describing dynamical systems with similar symmetries. The way that will be followed starts from a given group of symmetries, the determination of the invariants…
In this paper we give a new foundational, categorical formulation for operations and relations and objects parameterizing them. This generalizes and unifies the theory of operads and all their cousins including but not limited to PROPs,…
We give an introduction to logic tailored for algebraists, explaining how proofs in linear logic can be viewed as algorithms for constructing morphisms in symmetric closed monoidal categories with additional structure. This is made explicit…
We present a flexible data-driven method for dynamical system analysis that does not require explicit model discovery. The method is rooted in well-established techniques for approximating the Koopman operator from data and is implemented…
This paper gives an introduction to \textit{Cognidynamics}, that is to the dynamics of cognitive systems driven by optimal objectives imposed over time when they interact either with a defined virtual or with a real-world environment. The…