Related papers: Open Dynamical Systems as Coalgebras for Polynomia…
We use traced monoidal categories to give a precise general version of "geometry of interaction". We give a number of examples of both "particle-style" and "wave-style" instances of this construction. We relate these ideas to semantics of…
We study the operad of associative algebras equipped with a derivation. We show that it is determined by polynomials in several variables and substitution. Replacing polynomials by rational functions gives an operad which is isomorphic to…
We tersely review a recently introduced technique to identify systems of two nonlinearly-coupled Ordinary Di{\S}erential Equations (ODEs) solvable by algebraic operations; and we report some specifc examples of this kind, namely systems of…
A method for constructing homogeneous Lyapunov functions of degree 1 from polynomial invariant sets is presented for linear time varying systems, homogeneous dynamic systems and the class of nonlinear systems that can be represented as…
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…
A classification of commutative integral domains consisting of ordinary differential operators with matrix coefficients is established in terms of morphisms between algebraic curves.
Continuation of algebraic structures in families of dynamical systems is described using category theory, sheaves, and lattice algebras. Well-known concepts in dynamics, such as attractors or invariant sets, are formulated as functors on…
This paper presents (in its Lagrangian version) a very general "historical" formalism for dynamical systems, including time-dynamics and field theories. It is based on the universal notion of history. Its condensed and universal formulation…
We give complete presentations for the dagger-compact props of affine Lagrangian and coisotropic relations over an arbitrary field. This provides a unified family of graphical languages for both affinely constrained classical mechanical…
Using the braided version of Lawvere's algebraic theories and Mac Lane's PROPs, we introduce polynomial identities for arbitrary algebraic structures in a braided monoidal category C as well as their codimensions in the case when C is…
Some particular examples of classical and quantum systems on the lattice are solved with the help of orthogonal polynomials and its connection to continuous models are explored.
We adapt the concept of Lagrangian descriptors, which have been recently introduced as efficient indicators of phase space structures in chaotic systems, to unveil the key features of open maps. We apply them to the open tribaker map, a…
Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to…
Probabilistic logic programming is increasingly important in artificial intelligence and related fields as a formalism to reason about uncertainty. It generalises logic programming with the possibility of annotating clauses with…
We develop a sound and complete graphical theory for discrete linear time-invariant dynamical systems. The graphical syntax, as in previous work, is closely related to the classical notion of signal flow diagrams, differently from previous…
We propose a categorical framework for processes which interact bidirectionally with both an environment and a 'controller'. Examples include open learners, in which the controller is an optimiser such as gradient descent, and an approach…
In this paper we develop the theory of operads, algebras and modules in cofibrantly generated symmetric monoidal model categories. We give J-semi model strucures, which are a slightly weaker version of model structures, for operads and…
This paper is devoted to the study of some connections between coadjoint orbits in infinite dimensional Lie algebras, isospectral deformations and linearization of dynamical systems. We explain how results from deformation theory,…
Many recursive functions can be defined elegantly as the unique homomorphisms, between two algebras, two coalgebras, or one each, that are induced by some universal property of a distinguished structure. Besides the well-known applications…
Traditionally, numerical algorithms are seen as isolated pieces of code confined to an {\em in silico} existence. However, this perspective is not appropriate for many modern computational approaches in control, learning, or optimization,…