Related papers: Open Dynamical Systems as Coalgebras for Polynomia…
We extend the notions of nonautonomous dynamics to arbitrary groups, through groupoid morphisms. This also presents a generalization of classic dynamical systems and group actions. We introduce the structure of cotranslations, as a specific…
A coalgebraic definition of finite and infinite trace semantics for probabilistic transition systems has recently been given using a certain Kleisli category. In this paper this semantics is developed using a coalgebraic method which is an…
A novel scheme to simulate the evolution of a restricted set of observables of a quantum system is proposed. The set comprises the spectrum-generating algebra of the Hamiltonian. The idea is to consider a certain open-system evolution,…
The aim of the paper is to build a connection between two approaches towards categorical language theory: the coalgebraic and algebraic language theory for monads. For a pair of monads modelling the branching and the linear type we defined…
Motivated by a geometric decomposition of the vector field associated with the Gorini-Kossakowski-Lindblad-Sudarshan (GKLS) equation for finite-level open quantum systems, we propose a generalization of the recently introduced contact…
We introduce the concept of a "transitory" dynamical system---one whose time-dependence is confined to a compact interval---and show how to quantify transport between two-dimensional Lagrangian coherent structures for the Hamiltonian case.…
Cartan-Eilenberg systems play an prominent role in the homological algebra of filtered and graded differential groups and (co)chain complexes in particular. We define the concept of Cartan-Eilenberg systems of abelian groups over a poset.…
This paper focuses on polynomial dynamical systems over finite fields. These systems appear in a variety of contexts, in computer science, engineering, and computational biology, for instance as models of intracellular biochemical networks.…
Bialgebrae provide an abstract framework encompassing the semantics of different kinds of computational models. In this paper we propose a bialgebraic approach to the semantics of logic programming. Our methodology is to study logic…
A detailed exposition of foundations of a logic-algebraic model for reasoning with knowledge bases specified by propositional (Boolean) logic is presented. The model is conceived from the logical translation of usual derivatives on…
This paper describes the notion of \sigma -symmetry, which extends the one of \lambda-symmetry, and its application to reduction procedures of systems of ordinary differential equations and of dynamical systems as well. We also consider…
This paper studies the expressive and computational power of discrete Ordinary Differential Equations (ODEs), a.k.a. (Ordinary) Difference Equations. It presents a new framework using these equations as a central tool for computation and…
Modal types -- types that are derived from proof systems of modal logic -- have been studied as theoretical foundations of metaprogramming, where program code is manipulated as first-class values. In modal type systems, modality corresponds…
We introduce the notion of a family of convolution operators associated with a given elliptic partial differential operator. Such a convolution structure is shown to exist for a general class of Laplace-Beltrami operators on two-dimensional…
The survey is devoted to algebraic structures related to integrable ODEs and evolution PDEs. A description of Lax representations is given in terms of vector space decomposition of loop algebras into a direct sum of Taylor series and a…
We define polygonal dynamics as a family of dynamical systems acting on points in projective spaces. The most famous example is the pentagram map. Similar collapsing phenomena seem to occur in most of these systems. We prove it in some…
We define a family of structures called "opetopic algebras", which are algebraic structures with an underlying opetopic set. Examples of such are categories, planar operads, and Loday's combinads over planar trees. Opetopic algebras can be…
This paper charts a very direct path between the categorical approach to quantum mechanics, due to Abramsky and Coecke, and the older convex-operational approach based on ordered vector spaces (recently reincarnated as "generalized…
A concept of "evolving categories" is suggested to build a simple, scalable, mathematically consistent framework for representing in uniform way both data and algorithms. A state machine for executing algorithms becomes clear, rich and…
We introduce an abstract setting that allows to discuss wave equations with time-dependent boundary conditions by means of operator matrices. We show that such problems are well-posed if and only if certain perturbations of the same…