Related papers: Itegories
In this paper, we propose an axiomatic definition for a tensor product categorification. A tensor product categorification is an abelian category with a categorical action of a Kac-Moody algebra g in the sense of Rouquier or Khovanov-Lauda…
A classification result is obtained for the C*-algebras that are (stably isomorphic to) inductive limits of 1-dimensional noncommutative CW complexes with trivial $K_1$-group. The classifying functor Cu is defined in terms of the Cuntz…
Waldhausen's $S_\bullet$-construction gives a way to define the algebraic $K$-theory space of a category with cofibrations. Specifically, the $K$-theory space of a category with cofibrations $\mathcal{C}$ can be defined as the loop space of…
A sketch is a category equipped with specified collections of cones and cocones. Its models are functors to the category of sets that send the distinguished cones and cocones to limit cones and colimit cocones, respectively. Sketches…
A new approach to the construction of general persistent polyhierarchical classifications is proposed. It is based on implicit description of category polyhierarchy by a generating polyhierarchy of classification criteria. Similarly to…
Category theory has foundational importance because it provides conceptual lenses to characterize what is important in mathematics. Originally the main lenses were universal mapping properties and natural transformations. In recent decades,…
In 1966, John Isbell introduced a construction on categories which he termed the "couple category" but which has since come to be known as the Isbell envelope. The Isbell envelope, which combines the ideas of contravariant and covariant…
An $n$-sesquicategory is an $n$-globular set with strictly associative and unital composition and whiskering operations, which are however not required to satisfy the Godement interchange laws which hold in $n$-categories. In…
Treewidth is a well-known graph invariant with multiple interesting applications in combinatorics. On the practical side, many NP-complete problems are polynomial-time (sometimes even linear-time) solvable on graphs of bounded treewidth. On…
We introduce the notion of iterated group extensions, which, roughly speaking, is what one obtains by forming a group extension of a group extension. We interpret iterated extensions in terms of group cohomology, in the same way as…
A weak entwining structure in a 2-category K consists of a monad t and a comonad c, together with a 2-cell relating both structures in a way that generalizes a mixed distributive law.A weak entwining structure can be characterized as a…
Higher-dimensional category theory is the study of n-categories, operads, braided monoidal categories, and other such exotic structures. Although it can be treated purely as an algebraic subject, it is inherently topological in nature: the…
The main objects under consideration in this thesis are called maps, a certain class of graphs embedded on surfaces. Our problems have a powerful relatively recent tool in common, the so-called topological recursion (TR) introduced by…
We develop the theory of categories of measurable fields of Hilbert spaces and bounded fields of bounded operators. We examine classes of functors and natural transformations with good measure theoretic properties, providing in the end a…
Given any category $\mathcal{C}$ with pullbacks and a terminal object, we show that the data consisting of the objects of $\mathcal{C}$, the spans of $\mathcal{C}$, and the isomorphism classes of spans of spans of $\mathcal{C}$, forms a…
A differential category is an additive symmetric monoidal category, that is, a symmetric monoidal category enriched over commutative monoids, with an algebra modality, axiomatizing smooth functions, and a deriving transformation on this…
Bimonoidal categories (also known as rig categories) are categories with two monoidal structures, one of which distributes over the other. We formally define sheet diagrams, a graphical calculus for bimonoidal categories that was informally…
Weighted programs generalize probabilistic programs and offer a framework for specifying and encoding mathematical models by means of an algorithmic representation. Kleene algebra with tests is an algebraic formalism based on regular…
We construct an internal language for cartesian closed bicategories. Precisely, we introduce a type theory modelling the structure of a cartesian closed bicategory and show that its syntactic model satisfies an appropriate universal…
Turing's famous 'machine' model constitutes the first intuitively convincing framework for computing with real numbers. Kleene's computation schemes S1-S9 extend Turing's approach and provide a framework for computing with objects of any…