Related papers: Cellular Monads from Positive GSOS Specifications
Joint analysis of multi-omic single-cell data across cohorts has significantly enhanced the comprehensive analysis of cellular processes. However, most of the existing approaches for this purpose require access to samples with complete…
We consider bisimulation-invariant monadic second-order logic over various classes of finite transition systems. We present several combinatorial characterisations of when the expressive power of this fragment coincides with that of the…
Monadic programming presents a significant challenge for many programmers. In light of category theory, we offer a new perspective on the use of monads in functional programming. This perspective is clarified through numerous examples coded…
This article develops several main results for a general theory of homological algebra in categories such as the category of sheaves of idempotent modules over a topos. In the analogy with the development of homological algebra for abelian…
A very general KSGNS type dilation theorem in the context of right (not necessarily Hilbert) modules over $C^*$-algebras is presented. The proof uses Kolmogorov type decompositions for positive-definite kernels with values in spaces of…
The rise of large-scale multimodal models has paved the pathway for groundbreaking advances in generative modeling and reasoning, unlocking transformative applications in a variety of complex tasks. However, a pressing question that remains…
A coherent presentation of an n-category is a presentation by generators, relations and relations among relations. Confluent and terminating rewriting systems generate coherent presentations, whose relations among relations are defined by…
We introduce a notion of compatibility between constraint encoding and compositional structure. Phrased in the language of category theory, it is given by a "composable constraint encoding". We show that every composable constraint encoding…
The selection monad on a set consists of selection functions. These select an element from the set, based on a loss (dually, reward) function giving the loss resulting from a choice of an element. Abadi and Plotkin used the monad to model a…
We show that a set with an action of a locally finite-dimensional free partially commutative monoid and the corresponding semicubical set have isomorpic homology groups. We build a complex of finite length for the computing homology groups…
It is a well-known fact that the category $\mathsf{Cat}(\mathbf{C})$ of internal categories in a category $\mathbf{C}$ has a description in terms of crossed modules, when $\mathbf{C}=\mathbf{Gr}$ is the category of groups. The proof of this…
We give an explicit construction of the free monoid in monoidal abelian categories when the monoidal product does not necessarily preserve coproducts. We apply it to several new monoidal categories that appeared recently in the theory of…
Using the symmetric monoidal closed category structure of the category of measurable spaces, in conjunction with the Giry monad which we show is a strong monad, we analyze Bayesian inference maps and their construction in relation to the…
Guided by the microcosm principle of Baez-Dolan and by the algebraic definitions of operads of Kelly and Fiore, we introduce two "monoid-like" definitions of cyclic operads, one for the original, "exchangable-output" characterisation of…
This paper is the first of two articles which develop the notion of protoperads. In this one, we construct a new monoidal product on the category of reduced S-modules. We study the associated monoids, called protoperads, which are a…
Aczel-Mendler bisimulations are a coalgebraic extension of a variety of computational relations between systems. It is usual to assume that the underlying category satisfies some form of the axiom of choice, so that the collection of…
A G-solenoid is a laminated space whose leaves are copies of a single Lie group G, and whose transversals are totally disconnected sets. It inherits a G-action and can be considered as dynamical system. Free Z^d-actions on the Cantor set as…
Taking inspiration from the monadicity of complete atomic Boolean algebras, we prove that profinite modal algebras are monadic over Set. While analyzing the monadic functor, we recover the universal model construction - a construction…
We define a higher-order generalisation of the CPM construction based on arbitrary finite abelian group symmetries of symmetric monoidal categories. We show that our new construction is functorial, and that its closure under iteration can…
The purpose of this paper is twofold. First, we review applications of the bar duality of operads to the construction of explicit cofibrant replacements in categories of algebras over an operad. In view toward applications, we check that…