Related papers: Graded String Diagrams for Imprecise Probability a…
Equivariant monoids are very important objects in many branches of mathematics: they combine the notion of multiplication and the concept of a group action. In this paper we will construct categories which encode the structure borne by…
In this article we extend the theory of lax monoidal structures, also known as multitensors, and the monads on categories of enriched graphs that they give rise to. Our first principal result -- the lifting theorem for multitensors --…
This is mainly a brief review of some key achievements in a `hot'' area of theoretical and mathematical physics. The principal aim is to outline the basic structures underlying {\em integrable} quantum field theory models with {\em…
We propose a general classification of nonequilibrium steady states in terms of their stationary probability distribution and the associated probability currents. The stationary probabilities can be represented graph-theoretically as…
We begin with a brief sketch of what is known and conjectured concerning braided monoidal 2-categories and their applications to 4d topological quantum field theories and 2-tangles (surfaces embedded in 4-dimensional space). Then we give…
Applications of category theory often involve symmetric monoidal categories (SMCs), in which abstract processes or operations can be composed in series and parallel. However, in 2020 there remains a dearth of computational tools for working…
We discuss what it means for a symmetric monoidal category to be a module over a commutative semiring category. Each of the categories of (1) cartesian monoidal categories, (2) semiadditive categories, and (3) connective spectra can be…
This article gives a short step-by-step introduction to the representation of parametric Feynman integrals in scalar perturbative quantum field theory as periods of motives. The application of motivic Galois theory to the algebro-geometric…
It has long been known that every weak monoidal category A is equivalent via monoidal functors and monoidal natural transformations to a strict monoidal category st(A). We generalise the definition of weak monoidal category to give a…
When designing plans in engineering, it is often necessary to consider attributes associated to objects, e.g. the location of a robot. Our aim in this paper is to incorporate attributes into existing categorical formalisms for planning,…
In this paper we develop combinatorial techniques for the case of string algebras with the aim to give a characterization of string complexes with infinite minimal projective resolution. These complexes will be called \textit{periodic…
We introduce the notion of a diagram category and discuss its application to the invariant theory of classical groups and super groups, with some indications concerning extensions to quantum groups and quantum super groups. Tensor functors…
We give to the categorical theory PR of Primitive Recursion a logically simple, algebraic presentation, via equations between maps, plus one genuine Horner type schema, namely Freyd's uniqueness of the initialised iterated. Free Variables…
Probabilistic sentential decision diagrams are a class of structured-decomposable probabilistic circuits especially designed to embed logical constraints. To adapt the classical LearnSPN scheme to learn the structure of these models, we…
Beginning with a review of the arguments leading to the so-called c=1 barrier in the continuum formulation of noncritical string theory, the pathology is then exhibited in a discretized version of the theory, formulated through dynamical…
Topologists are sometimes interested in space-valued diagrams over a given index category, but it is tricky to say what such a diagram even is if we look for a notion that is stable under equivalence. The same happens in (homotopy) type…
We continue and extend previous work on the parameterized complexity analysis of the NP-hard Stable Roommates with Ties and Incomplete Lists problem, thereby strengthening earlier results both on the side of parameterized hardness as well…
We study semantic models of probabilistic programming languages over graphs, and establish a connection to graphons from graph theory and combinatorics. We show that every well-behaved equational theory for our graph probabilistic…
The structure of monoidal categories in which every arrow is invertible is analyzed in this paper, where we develop a 3-dimensional Schreier-Grothendieck theory of non-abelian factor sets for their classification. In particular, we state…
The logic of Dependence and Independence Bunched Implications (DIBI) is a logic to reason about conditional independence (CI); for instance, DIBI formulas can characterise CI in probability distributions and relational databases, using the…