Related papers: Binding bigraphs as symmetric monoidal closed theo…
A symmetric monoidal category is a category equipped with an associative and commutative (binary) product and an object which is the unit for the product. In fact, those properties only hold up to natural isomorphisms which satisfy some…
We introduce the wire calculus. Its dynamic features are inspired by Milner's CCS: a unary prefix operation, binary choice and a standard recursion construct. Instead of an interleaving parallel composition operator there are operators for…
We define biprops as a generalization of coloured props and of symmetric weak multicategories. These are bicategories whose objects form a free monoid. They are equipped with some structure resembling a symmetric strict tensor product. We…
Bimonoidal categories are categorical analogues of rings without additive inverses. They have been actively studied in category theory, homotopy theory, and algebraic $K$-theory since around 1970. There is an abundance of new applications…
In combinatorial topology we aim to triangulate manifolds such that their topological properties are reflected in the combinatorial structure of their description. Here, we give a combinatorial criterion on when exactly triangulations of…
Given a graph $G$, we define ${\bf bcg}(G)$ as the minimum $k$ for which $G$ can be contracted to the uniformly triangulated grid $\Gamma_{k}$. A graph class ${\cal G}$ has the SQG${\bf C}$ property if every graph $G\in{\cal G}$ has…
Liftable pairs of adjoint functors between braided monoidal categories in the sense of \cite{GV-OnTheDuality} provide auto-adjunctions between the associated categories of bialgebras. Motivated by finding interesting examples of such pairs,…
We study approximate equivalence relations up to commensurability, in the presence of a definable measure. As a basic framework, we give a presentation of probability logic based on continuous logic. Hoover's normal form is valid here; if…
We show that the categories of directed and undirected reflexive graphs carry exactly two (up to isomorphism) biclosed monoidal structures.
Calculi of string diagrams are increasingly used to present the syntax and algebraic structure of various families of circuits, including signal flow graphs, electrical circuits and quantum processes. In many such approaches, the semantic…
Closure spaces, a generalisation of topological spaces, have shown to be a convenient theoretical framework for spatial model checking. The closure operator of closure spaces and quasi-discrete closure spaces induces a notion of…
The class of intersection bigraphs of unit intervals of the real line whose ends may be open or closed is called a class of mixed unit interval bigraphs. This class of bigraphs is a strict superclass of the class of unit interval bigraphs.…
The paper defines polynomials in a bicategory $\mathscr{M}$. Polynomials in bicategories $\mathrm{Spn}\mathscr{C} \ $ of spans in a finitely complete category $\mathscr{C} \ $ agree with polynomials in $\mathscr{C} \ $ as defined by Nicola…
Let $\mathbb C$ be the set of complex numbers, and let $\mathcal P$ be a collection of complex polynomial maps in several variables. Assuming at least one $P\in\mathcal P$ depends on at least two variables, we classify all possibilities for…
We introduce a graphical language for closed symmetric monoidal categories based on an extension of string diagrams with special bracket wires representing internal homs. These bracket wires make the structure of the internal hom functor…
Covering and elimination inequalities are central to combinatorial optimization, yet their role has largely been studied in problem-specific settings or via no-good cuts. This paper introduces a unified perspective that treats these…
A biclique of a graph is a maximal complete bipartite subgraph. The biclique graph of a graph $G$, $KB(G)$, defined as the intersection graph of the bicliques of $G$, was introduced and characterized in 2010. However, this characterization…
Rigid monoidal 1-categories are ubiquitous throughout quantum algebra and low-dimensional topology. We study a generalization of this notion, namely rigid algebras in an arbitrary monoidal 2-category. Examples of rigid algebras include…
We introduce bimonads in a 2-category $\K$ and define biwreaths as bimonads in the 2-category $\bEM(\K)$ of bimonads, in the analogous fashion as Lack and Street defined wreaths. A biwreath is then a system containing a wreath, a cowreath…
A number of ill-posed inverse problems in signal processing, like blind deconvolution, matrix factorization, dictionary learning and blind source separation share the common characteristic of being bilinear inverse problems (BIPs), i.e. the…