Related papers: How to Represent Non-Representable Functors
We show that the non-trivially associated tensor category constructed from left coset representatives of a subgroup of a finite group is a modular category. Also we give a definition of the character of an object in a ribbon category which…
We rewrite classical topological definitions using the category-theoretic notation of arrows and are led to concise reformulations in terms of simplicial categories and orthogonality of morphisms, which we hope might be of use in the…
Many neural nets appear to represent data as linear combinations of "feature vectors." Algorithms for discovering these vectors have seen impressive recent success. However, we argue that this success is incomplete without an understanding…
Many real-world phenomena are naturally modeled by graphs and networks. However, classical graph models are often limited to pairwise interactions and may not adequately capture the richer structures that arise in practice. Higher-order…
This paper is the third in a series whose goal is to develop a fundamentally new way of viewing theories of physics. Our basic contention is that constructing a theory of physics is equivalent to finding a representation in a topos of a…
For representation by partial functions in the signature with intersection, composition and antidomain, we show that a representation is meet complete if and only if it is join complete. We show that a representation is complete if and only…
In this paper, we give several equivalent characterizations for a category with finite biproducts and the sum operation of arrows, and called categories satisfying these semiadditive $\mathbf{C}\mathbf{Mon}$-categories. This allow us to…
We introduce the theory of biset functors defined on finite categories. Previously, biset functors have been defined on groups, and in that context they are closely related to Mackey functors. Standard examples on groups include…
We show that the essentially algebraic theory of generalized algebraic theories, regarded as a category with finite limits, has a universal exponentiable arrow in the sense that any exponentiable arrow in any category with finite limits is…
There are different notions of computation, the most popular being monads, applicative functors, and arrows. In this article we show that these three notions can be seen as monoids in a monoidal category. We demonstrate that at this level…
Let X be a smooth projective variety defined over an algebraically closed field k. Nori constructed a category of vector bundles on X, called essentially finite vector bundles, which is reminiscent of the category of representations of the…
Higher order derivatives of functions are structured high dimensional objects which lend themselves to many alternative representations, with the most popular being multi-index, matrix and tensor representations. The choice between them…
We investigate a possible category theoretical description for agent based modeling by outlining justifications for two main principles to describe the valuations in a realistic way in microeconomics: 1) It is assumed that the valuations…
Certain results involving "higher structures" are not currently accessible to computer formalization because the prerequisite $\infty$-category theory has not been formalized. To support future work on formalizing $\infty$-category theory…
One goal of applied category theory is to better understand networks appearing throughout science and engineering. Here we introduce "structured cospans" as a way to study networks with inputs and outputs. Given a functor $L \colon…
We study the category $\mathcal{F}_n$ of finite-dimensional integrable representations of the periplectic Lie superalgebra $\mathfrak{p}(n)$. We define an action of the Temperley--Lieb algebra with infinitely many generators and defining…
A notion of a coring extension is defined and it is related to the existence of an additive functor between comodule categories that factorises through forgetful functors. This correspondence between coring extensions and factorisable…
This is the first in a series of papers in which we study representations of the Brauer category and its allies. We define a general notion of triangular category that abstracts key properties of the triangular decomposition of a semisimple…
Conditional independence has been widely used in AI, causal inference, machine learning, and statistics. We introduce categoroids, an algebraic structure for characterizing universal properties of conditional independence. Categoroids are…
Self-supervised models create representation spaces that lack clear semantic meaning. This interpretability problem of representations makes traditional explainability methods ineffective in this context. In this paper, we introduce a novel…