相关论文: A graphical calculus for semi-groupal categories

Tree-width is an invaluable tool for computational problems on graphs. But often one would like to compute on other kinds of objects (e.g. decorated graphs or even algebraic structures) where there is no known tree-width analogue. Here we…

In this work, we analyze the structure of the category of partial representations of a finite group $G$ as a multifusion category, providing an alternative way to describe simple objects and their tensor products. We describe the…

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…

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…

Within the Geometry of Interaction (GoI) paradigm, we present a setting that enables qualitative differences between classical and quantum processes to be explored. The key construction is the physical interpretation/realization of the…

Ara\'ujo, Kinyon and Konieczny (2011) pose several problems concerning the construction of arbitrary commuting graphs of semigroups. We observe that every star-free graph is the commuting graph of some semigroup. Consequently, we suggest…

The category Set_* of sets and partial functions is well-known to be traced monoidal, meaning that a partial function S+U -/-> T+U can be coherently transformed into a partial function S -/-> T. This transformation is generally described in…

Let $\mathcal C$ be a category with finite colimits, writing its coproduct $+$, and let $(\mathcal D, \otimes)$ be a braided monoidal category. We describe a method of producing a symmetric monoidal category from a lax braided monoidal…

Category theory provides a means through which many far-ranging fields of mathematics can be related by their similar structure. In a paper by Robinson [2], this interconnectivity afforded by categorical perspectives allowed for the…

We propose efficient algorithms for enumerating the notorious combinatorial structures of maximal planar graphs, called canonical orderings and Schnyder woods, and the related classical graph drawings by de Fraysseix, Pach, and Pollack…

Let $(\mathcal{C}, \otimes)$ be a monoidal dg-category. We construct a complex controlling the deformation of the monoidal structure on $\mathcal{C}$ together with the deformation of the underlying dg-category itself. We show that in the…

Given a monoidal category $\mathscr{C}$ with an object $J$, we construct a monoidal category $\mathscr{C}[J^{\vee}]$ by freely adjoining a right dual $J^{\vee}$ to $J$. We show that the canonical strong monoidal functor $\Omega :…

The main result of this paper utilizes the representation graph of a group $G$, $R(V,G)$, and gives a general construction of a diagrammatic category $\mathbf{Dgrams}_{R(V,G)}$. The proof of the main theorem shows that, given explicit…

We recall several categories of graphs which are useful for describing homotopy-coherent versions of generalized operads (e.g. cyclic operads, modular operads, properads, and so on), and give new, uniform definitions for their morphisms.…

The class of subarrangements of the well-studied braid arrangement, so-called graphic hyperplane arrangements, is important for analysing new concepts and properties in hyperplane arrangement theory. While there is a nice characterization…

We introduce "geometric" partial comodules over coalgebras in monoidal categories, as an alternative notion to the notion of partial action and coaction of a Hopf algebra introduced by Caenepeel and Janssen. The name is motivated by the…

Every countable directed graph generates a Fock space Hilbert space and a family of partial isometries. These operators also arise from the left regular representations of free semigroupoids derived from directed graphs. We develop a…

In this paper, we consider various graphs, namely: power graph, cyclic graph, enhanced power graph and commuting graph, on a finite semigroup $S$. For an arbitrary pair of these four graphs, we classify finite semigroups such that the…

Grothendieck-Verdier categories (also known as $\ast$-autonomous categories) generalize rigid monoidal categories, with notable representation-theoretic examples including categories of bimodules, modules over Hopf algebroids, and modules…

Graph convolutional networks have been successful in addressing graph-based tasks such as semi-supervised node classification. Existing methods use a network structure defined by the user based on experimentation with fixed number of layers…