Related papers: The compact double category $\mathbf{Int}(\mathbf{…
In this paper we revisit some pioneering efforts to equip Petri nets with compact operational models for expressing causality. The models we propose have a bisimilarity relation and a minimal representative for each equivalence class, and…
This paper is concerned with the automated complexity analysis of term rewrite systems (TRSs for short) and the ramification of these in implicit computational complexity theory (ICC for short). We introduce a novel path order with multiset…
Some aspects of basic category theory are developed in a finitely complete category $\C$, endowed with two factorization systems which determine the same discrete objects and are linked by a simple reciprocal stability law. Resting on this…
Category theory is a branch of mathematics that provides a formal framework for understanding the relationship between mathematical structures. To this end, a category not only incorporates the data of the desired objects, but also…
Dynamical systems---by which we mean machines that take time-varying input, change their state, and produce output---can be wired together to form more complex systems. Previous work has shown how to allow collections of machines to…
This monograph is a comprehensive study of the combinatorial structure of various operads of wiring diagrams and undirected wiring diagrams. Our first main objective is to prove a finite presentation theorem for each operad of wiring…
In this paper we give a new foundational, categorical formulation for operations and relations and objects parameterizing them. This generalizes and unifies the theory of operads and all their cousins including but not limited to PROPs,…
In the recent study of Virasoro action on characters, we discovered that it gets especially simple for peculiar linear combinations of the Virasoro operators: particular harmonics of $\hat w$-operators. In this letter, we demonstrate that…
Category theory provides a compact method of encoding mathematical structures in a uniform way, thereby enabling the use of general theorems on, for example, equivalence and universal constructions. In this article we develop the method of…
Category theory has been recently used as a tool for constructing and modeling an information flow framework. Here, we show that the flow of information can be described using preradicals. We prove that preradicals generalize the notion of…
We study the question when a $*$-autonomous Mix-category has a representation as a $*$-autonomous Mix-subcategory of a compact one. We define certain partial trace-like operation on morphisms of a Mix-category, which we call a mixed trace,…
We give a framework for comparing on the one hand theories of n-categories that are weakly enriched operadically, and on the other hand n-categories given as algebras for a contractible globular operad. Examples of the former are the…
A data structure for finite bounded acyclic categories has been built, which is useful to encode and manipulate abstract orientable incidence structure. It can be represented as a directed acyclic multigraph with weighted edges, where the…
We develop a classification of composite operators without gradients at Anderson-transition critical points in disordered systems. These operators represent correlation functions of the local density of states (or of wave-function…
The structure of a $k$-fold monoidal category as introduced by Balteanu, Fiedorowicz, Schw\"anzl and Vogt can be seen as a weaker structure than a symmetric or even braided monoidal category. In this paper we show that it is still…
Given a finite tensor category $\mathcal{C}$, we prove that a modified trace on the tensor ideal of projective objects can be obtained from a suitable trivialization of the Nakayama functor as right $\mathcal{C}$-module functor. Using a…
We give a new description of computads for weak globular $\omega$-categories by giving an explicit inductive definition of the free words. This yields a new understanding of computads, and allows a new definition of $\omega$-category that…
We construct a generalization of the Day convolution tensor product of presheaves that works for certain double $\infty$-categories. Using this construction, we obtain an $\infty$-categorical version of the well-known description of…
We define and study the $(\infty,2)$-category $\mathbf{Cat}_{\infty}(\mathcal{C})$ of $(\infty,1)$-categories internal to a general $(\infty,1)$-category $\mathcal{C}$ via an associated externalization construction. In the first part, we…
We develop an alternative to the May-Thomason construction used to compare operad based infinite loop machines to that of Segal, which relies on weak products. Our construction has the advantage that it can be carried out in $Cat$, whereas…