Related papers: Modular operads and the nerve theorem

This monograph provides a coherent development of operads, infinity operads, and monoidal categories, equipped with equivariant structures encoded by an action operad. A group operad is a planar operad with an action operad equivariant…

We introduce and study operadic categories with cardinalities in finite sets and establish conditions under which their associated theories of operads and algebras are equivalent to the standard framework introduced in 2015 by Batanin and…

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…

Let $\Lambda$ be the category of based finite sets $\mathbf{n}$ and based injections. We study properties of monoids and modules in $\Lambda$-sequences under the Kelly monoidal structure. In particular, we show that the forgetful functor…

We prove that a class of graphs with an excluded minor and with the maximum degree sublinear in the number of edges is maximally modular, that is, modularity tends to 1 as the number of edges tends to infinity.

We show that Verdier duality for certain sheaves on the moduli spaces of graphs associated to Koszul operads corresponds to Koszul duality of operads. This in particular gives a conceptual explanation of the appearance of graph cohomology…

We introduce moduli spaces of colored graphs, defined as spaces of non-degenerate metrics on certain families of edge-colored graphs. Apart from fixing the rank and number of legs these families are determined by various conditions on the…

The modular decomposition of a graph is a canonical representation of its modules. Algorithms for computing the modular decomposition of directed and undirected graphs differ significantly, with the undirected case being simpler, and…

Due to a theorem by Orlov every exact fully faithful functor between the bounded derived categories of coherent sheaves on smooth projective varieties is of Fourier-Mukai type. We extend this result to the case of bounded derived categories…

This paper addresses the semantics of weighted argumentation graphs that are bipolar, i.e. contain both attacks and supports for arguments. It builds on previous work by Amgoud, Ben-Naim et. al. We study the various characteristics of…

We present an alternative construction of Soergel's category of bimodules associated to a reflection faithful representation of a Coxeter system. We show that its objects can be viewed as sheaves on the associated moment graph. We introduce…

Curved algebras are a generalization of differential graded algebras which have found numerous applications recently. The goal of this foundational article is to introduce the notion of a curved operad, and to develop the operadic calculus…

We introduce the category of bicomodules for a comonad in a Grothendieck category whose underlying functor is right exact and preserves direct sums. We characterize comonads with a separable forgetful functor by means of cohomology groups…

A vertex colouring of a graph is called asymmetric if the only automorphism which preserves it is the identity. Tucker conjectured that if every automorphism of a connected, locally finite graph moves infinitely many vertices, then there is…

A graph class $\mathcal C$ is monadically dependent if one cannot interpret all graphs in colored graphs from $\mathcal C$ using a fixed first-order interpretation. We prove that monadically dependent classes can be exactly characterized by…

We show that the unbounded derived category of a Grothendieck category with enough projective objects is the base category of a derivator whose category of diagrams is the full 2-category of small categories. With this structure, we give a…

For a simple connected graph $G$ of order $n$, a bijective function $f:V(G)\to\{1,2,\cdots,n\}$ is said to be a Legendre cordial labeling modulo $p$, where $p$ is an odd prime, if the induced function $f_p^*:E(G)\to \{0,1\}$, defined by…

Schmidt characterised the class of rayless graphs by an ordinal rank function, which makes it possible to prove statements about rayless graphs by transfinite induction. Halin asked whether Schmidt's rank function can be generalised to…

We introduce a new operad-like structure that we call a reconnectad; the ``input'' of an element of a reconnectad is a finite simple graph, rather than a finite set, and ``compositions'' of elements are performed according to the notion of…

A colored graph is a directed graph in which nodes or edges have been assigned colors that are not necessarily unique. Observability problems in such graphs consider whether an agent observing the colors of edges or nodes traversed on a…