Related papers: Graphical combinatorics and a distributive law for…
We argue that operads provide a general framework for dealing with polynomials and combinatory completeness of combinatory algebras, including the classical $\mathbf{SK}$-algebras, linear $\mathbf{BCI}$-algebras, planar…
We use Giraudo's construction of combinatorial operads from monoids to offer a conceptual explanation of the origins of Hoffbeck's path sequences of shuffle trees, and use it to define new monomial orders of shuffle trees. One such order is…
In this thesis, we present a flexible framework for specifying and constructing operads which are suited to reasoning about network construction. The data used to present these operads is called a \emph{network model}, a monoidal variant of…
Distributive laws give a way of combining two algebraic structures expressed as monads; in this paper we propose a theory of distributive laws for combining algebraic structures expressed as Lawvere theories. We propose four approaches,…
Two very basic constructions involving experimental procedures are the formation of coarse-grained versions of experiments, and the formation of branching sequential experiments. The latter allow for the conditioning of states on the…
In a previous study, the algebraic formulation of the First Fundamental Theorem of Calculus (FFTC) is shown to allow extensions of differential and Rota-Baxter operators on the one hand, and to give rise to categorical explanations using…
It is well-known that every vertex-transitive graph admits a representation as a coset graph. In this paper, we extend this construction by introducing monodromy graphs defined through double cosets. Our main result establishes that every…
First, we give a functorial construction of a group associated to a symmetric operad. Applied to the endomorphism operad it gives the group of formal diffeomorphisms. Second, we associate a symmetric operad to any family of decorated graphs…
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…
In two previous papers, we exposed a combinatorial approach to the program of Geometry of Interaction, a program initiated by Jean-Yves Girard. The strength of our approach lies in the fact that we interpret proofs by simpler structures -…
The sandpile group of a graph is a well-studied object that combines ideas from algebraic graph theory, group theory, dynamical systems, and statistical physics. A graph's sandpile group is part of a larger algebraic structure on the graph,…
Tverberg's theorem says that a set with sufficiently many points in $\mathbb{R}^d$ can always be partitioned into $m$ parts so that the $(m-1)$-simplex is the (nerve) intersection pattern of the convex hulls of the parts. In…
We propose a new framework for the study of continuous time dynamical systems on networks. We view such dynamical systems as collections of interacting control systems. We show that a class of maps between graphs called graph fibrations…
We consider the extension of classical 2-dimensional topological quantum field theories to Klein topological quantum field theories which allow unorientable surfaces. We approach this using the theory of modular operads by introducing a new…
We will consider P-graph complexes, where P is a cyclic operad. P-graph complexes are natural generalizations of Kontsevich's graph complexes -- for P = the operad for associative algebras it is the complex of ribbon graphs, for P = the…
A new hierarchy of combinatorial operads is introduced, involving families of regular polygons with configurations of arcs, called decorated cliques. This hierarchy contains, among others, operads on noncrossing configurations, Motzkin…
The essential parts of the operad algebra are concisely presented, which should be useful when confronting with the operadic physics. It is also clarified how the Gerstenhaber algebras can be associated with the linear pre-operads (comp…
We develop layered monoidal theories -- a generalisation of monoidal theories combining formal descriptions of a system at different levels of abstraction. Via their representation as string diagrams, monoidal theories provide a graphical…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
It is well known since Stasheff's work that 1-fold loop spaces can be described in terms of the existence of higher homotopies for associativity (coherence conditions) or equivalently as algebras of contractible non-symmetric operads. The…