Related papers: Graphical combinatorics and a distributive law for…
The language of graph theory, or network science, has proven to be an exceptional tool for addressing myriad problems in neuroscience. Yet, the use of networks is predicated on a critical simplifying assumption: that the quintessential unit…
A binary relation on graphs is recursively enumerable if and only if it can be computed by a formula in monadic second-order logic. The latter means that the formula defines a set of graphs, in the usual way, such that each "computation…
This is a copy of my bachelor thesis, written under supervision of Sergey Shadrin in 2010. Original abstract: In this thesis we prove that the wheeled Poisson operad is not a wheeled Koszul operad. Chapter 1 introduces operads, the subclass…
The processes of constructing some graphs from others using binary operations of union with intersection (gluing) are studied. For graph classes closed with respect to gluing operations the elemental and operational bases are introduced.…
A new and extensive formalism is developed for monads and galaxies in non-standard enlargements. It is shown that monads and galaxies can be manipulated using order-preserving and order-reversing set-to-set maps, and that set properties…
Let M be a bicomplete, closed symmetric monoidal category. Let P be an operad in M, i.e., a monoid in the category of symmetric sequences of objects in M, with its composition monoidal structure. Let R be a P-co-ring, i.e., a comonoid in…
We introduce a new algebraic construction, {\em monop}, that combines monoids (with respect to the product of species), and operads (monoids with respect to the substitution of species) in the same algebraic structure. By the use of…
In this paper we introduce a notion of {\it generalized operad} containing as special cases various kinds of operad--like objects: ordinary, cyclic, modular, properads etc. We then construct inner cohomomorphism objects in their categories…
Wall-crossing phenomena are ubiquitous in many problems of algebraic geometry and theoretical physics. Various ways to encode the relevant information and the need to track the changes under the variation of parameters lead to rather…
We study the question of whether, for a given class of finite graphs, one can define, for each graph of the class, a linear ordering in monadic second-order logic, possibly with the help of monadic parameters. We consider two variants of…
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…
A theory of $\infty$-properads is developed, extending both the Joyal-Lurie $\infty$-categories and the Cisinski-Moerdijk-Weiss $\infty$-operads. Every connected wheel-free graph generates a properad, giving rise to the graphical category…
In the theory of operads we consider functors of generalized symmetric powers defined by sums of coinvariant modules under actions of symmetric groups. One observes classically that the construction of symmetric functors provides an…
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…
Universal algebra uniformly captures various algebraic structures, by expressing them as equational theories or abstract clones. The ubiquity of algebraic structures in mathematics and related fields has given rise to several variants of…
This thesis is concerned with the application of operadic methods, particularly modular operads, to questions arising in the study of moduli spaces of surfaces as well as applications to the study of homotopy algebras and new constructions…
The perturbative expansion of tensorial field theories in Feynman graphs can be interpreted as weighted generating series of some piecewise linear varieties. This simple fact establishes a link between two a priori distinct fields: the…
We construct a generalization of the operadic nerve, providing a translation between the equivariant simplicially enriched operadic world to the parametrized $\infty$-categorical perspective. This naturally factors through genuine…
Turi and Plotkin's bialgebraic semantics is an abstract approach to specifying the operational semantics of a system, by means of a distributive law between its syntax (encoded as a monad) and its dynamics (an endofunctor). This setup is…
We introduces the umodules, a generalisation of the notion of graph module. The theory we develop captures among others undirected graphs, tournaments, digraphs, and $2-$structures. We show that, under some axioms, a unique decomposition…