Related papers: Computads for generalised signatures
We initiate the study of non-semisimple algebras in fusion categories by establishing the framework of $\mathcal{C}$-species -- analogous to the framework of species and quivers used in the study of Artin algebras. Under the (necessary)…
We present a formalization of quasi-compact and quasi-separated schemes (qcqs-schemes) in the Cubical Agda proof assistant. We follow Grothendieck's functor of points approach, which defines schemes, the quintessential notion of modern…
We begin the systematic study of decision problems for finitely generated groups given by a solution to their word problem. We relate this to the study of computable analysis on the space of marked groups. We point out that several distinct…
We introduce the concept of a prenormed model of a particular kind of finitary single-sorted first-order theories, interpreted over a category with finite products. These are referred to as prealgebraic theories, for the fact that their…
We develop a representation theory of categories as a means to explore characteristic structures in algebra. Characteristic structures play a critical role in isomorphism testing of groups and algebras, and their construction and…
The paper introduces the notion of a weak bisimulation for coalgebras whose type is a monad satisfying some extra properties. In the first part of the paper we argue that systems with silent moves should be modelled coalgebraically as…
Generic computability has been studied in group theory and we now study it in the context of classical computability theory. A set A of natural numbers is generically computable if there is a partial computable function f whose domain has…
We prove that for any finite-dimensional differential graded algebra with separable semisimple part the category of perfect modules is equivalent to a full subcategory of the category of perfect complexes on a smooth projective scheme with…
In monadic programming, datatypes are presented as free algebras, generated by data values, and by the algebraic operations and equations capturing some computational effects. These algebras are free in the sense that they satisfy just the…
This paper presents a conceptual and efficient geometric framework to encode the algebraic structures on the category of superselection sectors of an algebraic quantum field theory on the $n$-dimensional lattice $\mathbb{Z}^n$. It is shown…
The goal of this paper is to find a close to isomorphic presentation of 3-manifolds in terms of Hopf algebraic expressions. To this end we define and compare three different braided tensor categories that arise naturally in the study of…
Many interesting classes of maps from homotopical algebra can be characterised as those maps with the right lifting property against certain sets of maps (such classes are sometimes referred to as cofibrantly generated). In a more…
Implicit computational complexity, which aims at characterizing complexity classes by machine-independent means, has traditionally been based, on the one hand, on programs and deductive formalisms for free algebras, and on the other hand on…
Coalgebras for analytic functors uniformly model graph-like systems where the successors of a state may admit certain symmetries. Examples of successor structure include ordered tuples, cyclic lists and multisets. Motivated by goals in…
Let M be a bicomplete, closed symmetric monoidal category. Let P be an operad in M, i.e., a monoid in the category of symmetric sequences of objects in M, with its composition monoidal structure. Let R be a P-co-ring, i.e., a comonoid in…
This article approaches the counting of subgraphs, in terms of signature-type functionals defined over combinatorial Hopf algebras of graphs. Well-known algebraic identities that arise in the context of counting subgraphs are then captured…
This paper investigates some issues arising in categorical models of reversible logic and computation. Our claim is that the structural (coherence) isomorphisms of these categorical models, although generally overlooked, have decidedly…
Quantum computing is captured in the formalism of the monoidal subcategory of $\textbf{Vect}_{\mathbb C}$ generated by $\mathbb C^2$ -- in particular, quantum circuits are diagrams in $\textbf{Vect}_{\mathbb C}$ -- while topological quantum…
Shephard groups are common generalizations of Coxeter groups, Artin groups, and graph products of cyclic groups. Their definition is similar to that of a Coxeter group, but generators may have arbitrary order rather than strictly order 2.…
In this paper, we introduce the cofibrant derived category of a group algebra $kG$ and study its relation to the derived category of $kG$. We also define the cofibrant singularity category of $kG$, whose triviality characterizes the…