Related papers: Smooth coalgebra: testing vector analysis
We describe a general approach to deriving linear-time logics for a wide variety of state-based, quantitative systems, by modelling the latter as coalgebras whose type incorporates both branching and linear behaviour. Concretely, we define…
The syntactic behaviour of texts can highly vary depending on their contexts (e.g. author, genre, etc.). From the standpoint of stylometry, it can be helpful to objectively measure this behaviour. In this paper, we discuss how coalgebras…
The analysis of concurrent and reactive systems is based to a large degree on various notions of process equivalence, ranging, on the so-called linear-time/branching-time spectrum, from fine-grained equivalences such as strong bisimilarity…
Dynamical models underpin our ability to understand and predict the behavior of natural systems. Whether dynamical models are developed from first-principles derivations or from observational data, they are predicated on our choice of state…
We investigate the construction of coherent states for quantum theories of connections based on graphs embedded in a spatial manifold, as in loop quantum gravity. We discuss the many subtleties of the construction, mainly related to the…
A complete mathematical framework for coalgebraic formulation of supergeometry and its infinite-dimensional extension is proposed. Within this approach a supermanifold is defined as a graded coalgebra endowed with a smooth structure. The…
Despite high-dimensionality of images, the sets of images of 3D objects have long been hypothesized to form low-dimensional manifolds. What is the nature of such manifolds? How do they differ across objects and object classes? Answering…
This is the first of a series of papers which are devoted to a comprehensive theory of maps between orbifolds. In this paper, we define the maps in the more general context of orbispaces, and establish several basic results concerning the…
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…
Systems of ordinary differential equations (or dynamical forms in Lagrangian mechanics), induced by embeddings of smooth fibered manifolds over one-dimensional basis, are considered in the class of variational equations. For a given…
In graph learning, maps between graphs and their subgraphs frequently arise. For instance, when coarsening or rewiring operations are present along the pipeline, one needs to keep track of the corresponding nodes between the original and…
In [1] we introduced the concept of structured space, which is a topological space that locally resembles some algebraic structures. In [2] we proceeded the study of these spaces, developing two cohomology theories. The aim of this paper is…
We study manifolds arising as spaces of sections of complex manifolds fibering over the projective line with normal bundle of each section isomorphic to several copies of O(k). Such manifolds provide a natural setting for certain integrable…
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…
The conditions under which a given manifold $M$ may be given a tangent bundle or a cotangent bundle structure are analyzed. This is an important property arising in different contexts. For instance, in the study of integrability of a given…
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…
A theory of graded manifolds can be viewed as a generalization of differential geometry of smooth manifolds. It allows one to work with functions which locally depend not only on ordinary real variables, but also on $\mathbb{Z}$-graded…
Monoidal computer is a categorical model of intensional computation, where many different programs correspond to the same input-output behavior. The upshot of yet another model of computation is that a categorical formalism should provide a…
Using the theory of extensors developed in a previous paper we present a theory of the parallelism structure on arbitrary smooth manifold. Two kinds of Cartan connection operators are introduced and both appear in intrinsic versions (i.e.,…
Temporal logics are an obvious high-level descriptive companion formalism to dynamical systems which model behavior as deterministic evolution of state over time. A wide variety of distinct temporal logics applicable to dynamical systems…