Related papers: A constructive approach to Freyd categories
We describe a procedure for constructing morphisms in additive categories, combining Auslander's concept of a morphism determined by an object with the existence of flat covers. Also, we show how flat covers are turned into projective…
We study Serre structures on categories enriched in pivotal monoidal categories, and apply this to study Serre structures on two types of graded k-linear categories: categories with group actions and categories with graded hom spaces. We…
This paper provides a unifying view of a wide range of problems of interest in machine learning by framing them as the minimization of functionals defined on the space of probability measures. In particular, we show that generative…
It is known that finite crossed modules provide premodular tensor categories. These categories are in fact modularizable. We construct the modularization and show that it is equivalent to the module category of a finite Drinfeld double.
This is a survey on the state-of-the-art of the classification of finite-dimensional complex Hopf algebras. This general question is addressed through the consideration of different classes of such Hopf algebras. Pointed Hopf algebras…
We introduce the notion of an enriched fibration, i.e. a fibration whose total category and base category are enriched in those of a monoidal fibration in an appropriate way. Furthermore, we provide a way to obtain such a structure,…
This paper introduces the concept of gluing in a general category, enabling us to define categories that admit glued-up objects. To achieve this, we introduce the notion of a gluing index category. Subsequently, we provide an entirely…
We generalize the notion of ends and coends in category theory to the realm of module categories over finite tensor categories. We call this new concept "module (co)end". This tool allows us to give different proofs to several known results…
A formulation of quantum mechanics based on replacing the general unitary group by finite groups is considered. To solve problems arising in the context of this formulation, we use computer algebra and computational group theory methods.
Completeness proofs in categorical semantics usually proceed by building a syntactic category whose composition is given by substitution. For untyped effectful Call-by-Value languages, this runs into a basic obstacle: there is no canonical…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
We introduce the basic elements of the theory of parametrized $\infty$-categories and functors between them. These notions are defined as suitable fibrations of $\infty$-categories and functors between them. We give as many examples as we…
Tilting theory has been a very important tool in the classification of finite dimensional algebras of finite and tame representation type, as well as, in many other branches of mathematics. Happel [Ha] proved that generalized tilting…
A classification is provided of functors, in particular polynomial ones, from a category with a zero object in which every object is a finite sum of copies of a generating object, into an abelian category. This classification is extended to…
Many clustering schemes are defined by optimizing an objective function defined on the partitions of the underlying set of a finite metric space. In this paper, we construct a framework for studying what happens when we instead impose…
One of the open problems in higher category theory is the systematic construction of the higher dimensional analogues of the Gray tensor product. In this paper we continue the work of [7] to adapt the machinery of globular operads [4] to…
A graded tensor category over a group $G$ will be called a strongly $G$-graded tensor category if every homogeneous component has at least one multiplicativily invertible object. Our main result is a description of the module categories…
Structured recursion schemes have been widely used in constructing, optimising, and reasoning about programs over inductive and coinductive datatypes. Their plain forms, catamorphisms and anamorphisms, are restricted in expressiveness. Thus…
The structure of the category of matroids and strong maps is investigated: it has coproducts and equalizers, but not products or coequalizers; there are functors from the categories of graphs and vector spaces, the latter being faithful;…
We want to replace categories, functors and natural transformations by categories, open functors and open natural transformations. In analogy with open dynamical systems, the adjective open is added here to mean that some external…