Related papers: Categories of graphs for operadic structures
We study the class of 1-perfectly orientable graphs, that is, graphs having an orientation in which every out-neighborhood induces a tournament. 1-perfectly orientable graphs form a common generalization of chordal graphs and circular arc…
We introduce a functorial construction $\mathsf{C}$ which takes unitary magmas $\mathcal{M}$ as input and produces operads. The obtained operads involve configurations of chords labeled by elements of $\mathcal{M}$, called…
We consider constrained variants of graph homomorphisms such as embeddings, monomorphisms, full homomorphisms, surjective homomorpshims, and locally constrained homomorphisms. We also introduce a new variation on this theme which derives…
We apply the effective integration theory of Lie-graph algebras, developed recently by the authors, to the deformation and homotopy theories of types of bialgebras, that is structures controlled by a properad, like associative bialgebras,…
Graph classification plays an important role is data mining, and various methods have been developed recently for classifying graphs. In this paper, we propose a novel method for graph classification that is based on homotopy equivalence of…
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…
Pursuing a generalization of group symmetries of modular categories to category symmetries in topological phases of matter, we study linear Hopf monads. The main goal is a generalization of extension and gauging group symmetries to category…
We give a new proof of the non-triviality of wheel graph homology classes using higher operations on Lie graph homology and a derived version of Koszul duality for modular operads.
We extend the notion of graph homomorphism to cellularly embedded graphs (maps) by designing operations on vertices and edges that respect the surface topology; we thus obtain the first definition of map homomorphism that preserves both the…
This paper provides some background to the theory of operads, used in the first author's papers on 2d topological field theory (hep-th/921204, CMP 159 (1994), 265-285; hep-th/9305013). It is intended for specialists.
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of these diagrams is that edges need not be connected to…
We show how non-symmetric operads (or multicategories), symmetric operads, and clones, arise from three suitable monads on Cat, each extending to a (pseudo-)monad on the bicategory of categories and profunctors. We also explain how other…
Circuit algebras, used in the study of finite-type knot invariants, are a symmetric analogue of Jones's planar algebras. They are very closely related to circuit operads, which are a variation of modular operads admitting an extra monoidal…
We describe proper actors from the underlying groupoid of a graph C*-algebra to another \'etale groupoid in terms of bisections. This allows to understand graph morphisms and the *-homomorphisms that they induce more conceptually. More…
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…
We study differential graded operads and $p$-adic stable homotopy theory. We first construct a new class of differential graded operads, which we call the stable operads. These operads are, in a particular sense, stabilizations of…
The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.
The category of differential graded operads is a cofibrantly generated model category and as such inherits simplicial mapping spaces. The vertices of an operad mapping space are just operad morphisms. The 1-simplices represent homotopies…
In a number of recent papers, (k+l)-graphs have been constructed from k-graphs by inserting new edges in the last l dimensions. These constructions have been motivated by C*-algebraic considerations, so they have not been treated…
Algorithmicists are well-aware that fast dynamic programming algorithms are very often the correct choice when computing on compositional (or even recursive) graphs. Here we initiate the study of how to generalize this folklore intuition to…