Related papers: Linear Arboreal Categories
We set up a fibred categorical theory of obstruction and classification of morphisms that specializes to the one of monoidal functors between categorical groups and also to the Schreier-Mac Lane theory of group extensions. Further…
We propose a generalization of Categorial Grammar in which lexical categories are defined by means of recursive constraints. In particular, the introduction of relational constraints allows one to capture the effects of (recursive) lexical…
A new tree model is introduced based on ordered trees, by distinguishing exactly one child of each node that \emph{has} children. The basic enumeration leads to a cubic equation of the generating function. The extraction of its coefficients…
To every group $G$ we associate a linear monoidal category $\mathcal{P}\mathit{ar}(G)$ that we call a group partition category. We give explicit bases for the morphism spaces and also an efficient presentation of the category in terms of…
Combinatorial model categories were introduced by J. H. Smith as model categories which are locally presentable and cofibrantly generated. He has not published his results yet but proofs of some of them were presented by T. Beke or D.…
This is the second paper in a series on representations over diagrams of abelian categories. We show that, under certain conditions, a compatible family of abelian model categories indexed by a skeletal small category can be amalgamated…
This chapter describes interrelations between: (1) algebraic structure on sets of scalars, (2) properties of monads associated with such sets of scalars, and (3) structure in categories (esp. Lawvere theories) associated with these monads.…
One of the fundamental properties of the Mandelbrot set is that the set of postcritically finite parameters is structured like a tree. We extend this result to the set of quadratic kneading sequences and show that this space contains no…
Using the category of metric spaces as a template, we develop a metric analogue of the categorical semantics of classical/intuitionistic logic, and show that the natural notion of predicate in this "continuous semantics" is equivalent to…
We develop an algebraic notion of recognizability for languages of words indexed by countable linear orderings. We prove that this notion is effectively equivalent to definability in monadic second-order (MSO) logic. We also provide three…
We study a broad class of random labelled trees in which integer-valued labels evolve along the edges according to increments in $\{-1, 0, 1\}$. These models include e.g. branching random walks, embedded complete and incomplete binary…
We review the construction of braided tensor categories and modular tensor categories from representations of vertex operator algebras, which correspond to chiral algebras in physics. The extensive and general theory underlying this…
We introduce fibred type-theoretic fibration categories which are fibred categories between categorical models of Martin-L\"{o}f type theory. Fibred type-theoretic fibration categories give a categorical description of logical predicates…
Category theory provides a means through which many far-ranging fields of mathematics can be related by their similar structure. In a paper by Robinson [2], this interconnectivity afforded by categorical perspectives allowed for the…
In this paper, we have studied the axiomatics of {\it Ann-categories} and {\it categorical rings.} These are the categories with distributivity constraints whose axiomatics are similar with those of ring structures. The main result we have…
A notion of morphism that is suitable for the sheaf-theoretic approach to contextuality is developed, resulting in a resource theory for contextuality. The key features involve using an underlying relation rather than a function between…
Quantum categories have been recently studied because of their relation to bialgebroids, small categories, and skew monoidales. This is the first of a series of papers based on the author's PhD thesis in which we examine the theory of…
Standard methods of using categorical variables as predictors either endow them with an ordinal structure or assume they have no structure at all. However, categorical variables often possess structure that is more complicated than a linear…
Presheaf models provide a formulation of labelled transition systems that is useful for, among other things, modelling concurrent computation. This paper aims to extend such models further to represent stochastic dynamics such as shown in…
Algorithms for binary classification based on adaptive tree partitioning are formulated and analyzed for both their risk performance and their friendliness to numerical implementation. The algorithms can be viewed as generating a set…