Related papers: Partitioned binary relations
The main result here gives an algebra(/linear category) isomorphism between a geometrically defined subcategory $J^1_0$ of a short Brauer category $J_0$ and a certain one-parameter specialisation of the blob category $b$. That is, we prove…
We relativise double categories of relations to stable orthogonal factorisation systems. Furthermore, we present the characterisation of the relative double categories of relations in two ways. The first utilises a generalised comprehension…
A double category of relations is essentially a cartesian equipment with strong, discrete and functorial tabulators and for which certain local products satisfy a Frobenius Law. A double category of relations is equivalent to a double…
Motivated by applications in databases, this paper considers various fragments of the calculus of binary relations. The fragments are obtained by leaving out, or keeping in, some of the standard operators, along with some derived operators…
We force $2^\lambda$ to be large and for many pairs in the interval $(\lambda,2^\lambda)$ a stronger version of the polarized partition relations hold. We apply this toproblem in general topology
We introduce the marked Brauer algebra and the marked Brauer category. These generalize the analogous constructions for the ordinary Brauer algebra to the setting of a homogeneous bilinear form on a $\mathbb{Z}_2$-graded vector space. We…
We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…
In a previous paper, we presented an infinite dimensional associative diagram algebra that satisfies the relations of the generalized Temperley--Lieb algebra having a basis indexed by the fully commutative elements of the Coxeter group of…
We introduce the calculus of neo-Peircean relations, a string diagrammatic extension of the calculus of binary relations that has the same expressivity as first order logic and comes with a complete axiomatisation. The axioms are obtained…
We introduce a correspondence between phylogenetic trees and Brauer diagrams, inspired by links between binary trees and matchings described by Diaconis and Holmes (1998). This correspondence gives rise to a range of semigroup structures on…
In braided tensor categories we show the Maschke's theorem and give the necessary and sufficient conditions for double cross biproducts and crossbiproducts and biproducts to be bialgebras. We obtain the factorization theorem for braided…
We describe the planar rook category, the rook category, the rook-Brauer category, and the Motzkin category in terms of generators and relations. We show that the morphism spaces of these categories have linear bases given by planar rook…
This paper studies the problem of decomposing a low-rank positive-semidefinite matrix into symmetric factors with binary entries, either $\{\pm 1\}$ or $\{0,1\}$. This research answers fundamental questions about the existence and…
We work with a generalization of knot theory, in which one diagram is reachable from another via a finite sequence of moves if a fixed condition, regarding the existence of certain morphisms in an associated category, is satisfied for every…
We give a new type of Schur-Weyl duality for the representations of a family of quantum subgroups and their centralizer algebra. We define and classify singly-generated, Yang-Baxter relation planar algebras. We present the skein theoretic…
We define a class of algebras describing links of binary isolating formulas on a set of realizations for a family of 1-types of a complete theory. We prove that a set of labels for binary isolating formulas on a set of realizations for a…
In this paper, we construct a differential graded Lie algebra whose Maurer-Cartan elements are given by crossed homomorphisms on Leibniz algebras. This allows us to define cohomology for a crossed homomorphism. Finally, we study linear…
In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for…
If G is a non-cyclic finite group, non-isomorphic G-sets X, Y may give rise to isomorphic permutation representations C[X] and C[Y]. Equivalently, the map from the Burnside ring to the representation ring of G has a kernel. Its elements are…
We give a characterisation of the idempotents of the partition monoid, and use this to enumerate the idempotents in the finite partition, Brauer and partial Brauer monoids, giving several formulae and recursions for the number of…