Related papers: Functor is to Lens as Applicative is to Biplate: I…
This work introduces Bilinear Classes, a new structural framework, which permit generalization in reinforcement learning in a wide variety of settings through the use of function approximation. The framework incorporates nearly all existing…
Coalgebras for an endofunctor provide a category-theoretic framework for modeling a wide range of state-based systems of various types. We provide an iterative construction of the reachable part of a given pointed coalgebra that is inspired…
We introduce an enriched notion of a coalgebra over an operad P in a symmetric monoidal V-category C. When C is semicartesian and P is unital, we construct a V-endofunctor on C associated to P and give conditions under which it is a…
We present categories of open dynamical systems with general time evolution as categories of coalgebras opindexed by polynomial interfaces, and show how this extends the coalgebraic framework to capture common scientific applications such…
Let $d \geq 2$. We consider the symmetric monoidal category of oriented Riemannian $d$-manifolds with conformal open embeddings. The prefactorization algebra associated with the conformal Laplacian defines a symmetric monoidal functor from…
We use the connection between automata and logic to prove that a wide class of coalgebraic fixpoint logics enjoys uniform interpolation. To this aim, first we generalize one of the central results in coalgebraic automata theory, namely…
A natural connection between rational functions of several real or complex variables, and subspace collections is explored. A new class of function, superfunctions, are introduced which are the counterpart to functions at the level of…
We construct a monoidal model structure on the category of all curved coalgebras and show that it is Quillen equivalent, via the extended bar-cobar adjunction, to another model structure we construct on the category of curved algebras. When…
Category theory offers a mathematical foundation for knowledge representation and database systems. Popular existing approaches model a database instance as a functor into the category of sets and functions, or as a 2-functor into the…
This thesis proposes a combinatorial generalization of a nilpotent operator on a vector space. The resulting object is highly natural, with basic connections to a variety of fields in pure mathematics, engineering, and the sciences. For the…
We introduce and analyze parallelizable algorithms to compress and accurately reconstruct finite simplicial complexes that have non-trivial automorphisms. The compressed data -- called a complex of groups -- amounts to a functor from (the…
Let $\mathfrak{g}$ be a Leibniz algebra and $E$ a vector space containing $\mathfrak{g}$ as a subspace. All Leibniz algebra structures on $E$ containing $\mathfrak{g}$ as a subalgebra are explicitly described and classified by two…
We generalize the small object argument in order to allow for its application to proper classes of maps (as opposed to sets of maps in Quillen's small object argument). The necessity of such a generalization arose with appearance of several…
As shown in a previous paper by the same authors, the theory of Galois functors provides a categorical framework for the characterisation of bimonads on any category as Hopf monads and also for the characterisation of opmonoidal monads on…
We introduce a framework to define coalgebra and bialgebra structures on two-dimensional (2D) square lattices, extending the algebraic theory of Hopf algebras and quantum groups beyond the one-dimensional (1D) setting. Our construction is…
Recently, there has been renewed interest in the theory and applications of de Paiva's dialectica categories and their relationship to the category of polynomial functors. Both fall under the theory of generalized polynomial categories,…
A qualgebra $G$ is a set having two binary operations that satisfy compatibility conditions which are modeled upon a group under conjugation and multiplication. We develop a homology theory for qualgebras and describe a classifying space…
The notion of homomorphism indistinguishability offers a combinatorial framework for characterizing equivalence relations of graphs, in particular equivalences in counting logics within finite model theory. That is, for certain graph…
Big data programming frameworks have become increasingly important for the development of applications for which performance and scalability are critical. In those complex frameworks, optimizing code by hand is hard and time-consuming,…
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…