Related papers: Categories of graphs for operadic structures
It is well known that the existence of a braiding in a monoidal category V allows many structures to be built upon that foundation. These include a monoidal 2-category V-Cat of enriched categories and functors over V, a monoidal bicategory…
Let $\mathbb{E}_d$ denote the little discs operad for $1 \le d \le \infty$ and let $\mathcal{C}$ be an $\infty$-category all of whose mapping spaces are $n$-truncated. We prove that when considering $\mathbb{E}_d$-monoids in $\mathcal{C}$,…
Higher-dimensional category theory is the study of n-categories, operads, braided monoidal categories, and other such exotic structures. It draws its inspiration from areas as diverse as topology, quantum algebra, mathematical physics,…
In this paper, we initiate the generalisation of the operadic calculus which governs the properties of homotopy algebras to a properadic calculus which governs the properties of homotopy gebras over a properad. In this first article of a…
It it shown that geometric morphisms between elementary toposes can be represented as adjunctions between the corresponding categories of locales. These adjunctions are characterised as those that preserve the order enrichment, commute with…
In the standard Category of Graphs, the graphs allow only one edge to be incident to any two vertices, not necessarily distinct, and the graph morphisms must map edges to edges and vertices to vertices while preserving incidence. We refer…
A moment category is endowed with a distinguished set of split idempotents, called moments, which can be transported along morphisms. Equivalently, a moment category is a category with an active/inert factorisation system fulfilling two…
We extend homological perturbation theory to encompass algebraic structures governed by operads and cooperads. The main difficulty is to find a suitable notion of algebra homotopy that generalizes to algebras over operads O. To solve this…
We introduce a general notion of enrichment for homotopy-coherent algebraic structures described by Segal conditions, using the framework of "algebraic patterns" developed in our previous work. This recovers several known examples of…
Clones are specializations of operads forming powerful instruments to describe varieties of algebras wherein repeating variables are allowed in their equations. They allow us in this way to realize and study a large range of algebraic…
We describe the modular operad structure on the moduli spaces of pointed stable curves equipped with an admissible $G$-cover. To do this we are forced to introduce the notion of an operad colored not by a set but by the objects of a…
In this paper, we extend the definition of cohomology associated to monotone graph properties, to encompass twisted functor coefficients. We introduce oriented matchings on graphs, and focus on their (twisted) cohomology groups. We…
We prove a coherence theorem for braided monoidal bicategories and relate it to the coherence theorem for monoidal bicategories. We show how coherence for these structures can be interpretted topologically using up-to-homotopy operad…
We use Lurie's symmetric monoidal envelope functor to give two new descriptions of $\infty$-operads: as certain symmetric monoidal $\infty$-categories whose underlying symmetric monoidal $\infty$-groupoids are free, and as certain symmetric…
We study the subcategory of topological operads $P$ such that $P(0) = *$ (the category of unitary operads in our terminology). We use that this category inherits a model structure, like the category of all operads in topological spaces, and…
In the context of categories equipped with a structure of nullhomotopies, we introduce the notion of homotopy torsion theory. As special cases, we recover pretorsion theories as well as torsion theories in multi-pointed categories and in…
In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…
The study of the graph diameter of polytopes is a classical open problem in polyhedral geometry and the theory of linear optimization. In this paper we continue the investigation initiated in [4] by introducing a vast hierarchy of…
Networks can be combined in various ways, such as overlaying one on top of another or setting two side by side. We introduce "network models" to encode these ways of combining networks. Different network models describe different kinds of…
Threshold graphs are a prevalent and widely studied class of simple graphs. They have several equivalent definitions which makes them a go-to class for finding examples and counter examples when testing and learning. This versatility has…