Related papers: A Functorial Perspective on (Multi)computational I…
In the standard category of directed graphs, graph morphisms map edges to edges. By allowing graph morphisms to map edges to finite paths (path homomorphisms of graphs), we obtain an ambient category in which we determine subcategories…
There are several forms of irreducibility in computing systems, ranging from undecidability to intractability to nonlinearity. This paper is an exploration of the conceptual issues that have arisen in the course of investigating speed-up…
Eight categorical soundness and completeness theorems are established within the framework of algebraic theories. Exactly six of the eight deduction systems exhibit complete semantics within the cartesian monoidal category of sets. The…
In this article, we study criteria for producing six-functor formalisms and morphisms between them. One notable application is that the motivic homotopy theory of algebraic stacks is the universal six-functor functor formalism in a strong…
This paper presents a theory of systemic undecidability, reframing incomputability as a structural property of systems rather than a localized feature of specific functions or problems. We define a notion of causal embedding and prove a…
In this note, we provide some categorical perspectives on the relativization construction arising from quantum measurement theory in the presence of symmetries and occupying a central place in the operational approach to quantum reference…
We axiomatically define (pre-)Hilbert categories. The axioms resemble those for monoidal Abelian categories with the addition of an involutive functor. We then prove embedding theorems: any locally small pre-Hilbert category whose monoidal…
Two-dimensional conformal field theory (CFT) can be defined through its correlation functions. These must satisfy certain consistency conditions which arise from the cutting of world sheets along circles or intervals. The construction of a…
We introduce a metric-dependent geometric variant of factorization homology in conformally flat Riemannian geometry for $d \geq 2$. Its coefficients are symmetric monoidal functors from a disk category in conformal Riemannian geometry to…
We introduce the normal produoidal category of monoidal contexts over an arbitrary monoidal category. In the same sense that a monoidal morphism represents a process, a monoidal context represents an incomplete process: a piece of a…
We introduce a topology on the space of all isomorphism types represented in a given class of countable models, and use this topology as an aid in classifying the isomorphism types. This mixes ideas from effective descriptive set theory and…
Compositional data are commonly known as multivariate observations carrying relative information. Even though the case of vector or even two-factorial compositional data (compositional tables) is already well described in the literature,…
This paper presents an abstraction of Hoare logic to traced symmetric monoidal categories, a very general framework for the theory of systems. Our abstraction is based on a traced monoidal functor from an arbitrary traced monoidal category…
We present a systematic, algebraically based, design methodology for efficient implementation of computer programs optimized over multiple levels of the processor/memory and network hierarchy. Using a common formalism to describe the…
Differential categories were introduced to provide a minimal categorical doctrine for differential linear logic. Here we revisit the formalism and, in particular, examine the two different approaches to defining differentiation which were…
Universal algebra uniformly captures various algebraic structures, by expressing them as equational theories or abstract clones. The ubiquity of algebraic structures in mathematics and related fields has given rise to several variants of…
We construct a modular functor which takes its values in the monoidal bicategory of finite categories, left exact functors and natural transformations. The modular functor is defined on bordisms that are 2-framed. Accordingly we do not need…
Chordal and factor-width decomposition methods for semidefinite programming and polynomial optimization have recently enabled the analysis and control of large-scale linear systems and medium-scale nonlinear systems. Chordal decomposition…
In this survey, we summarize some results in the literature involving the mesh category, which is a combinatorial representation of the category of modules over a finite-dimensional associative algebra. We discuss Riedtmann's well-behaved…
Unitary Ribbon Fusion Categories (URFC) formalize anyonic theories. It has been widely assumed that the same category formalizes a topological quantum computing model. However, in previous work, we addressed and resolved this confusion and…