Related papers: Graphical combinatorics and a distributive law for…
Graph-structured combinatorial challenges are inherently difficult due to their nonlinear and intricate nature, often rendering traditional computational methods ineffective or expensive. However, these challenges can be more naturally…
We study the operad structure on the homology of moduli spaces of pointed rooted trees of $d$-dimensional projective spaces, introduced by Chen, Gibney and Krashen a couple of decades ago. We describe this operad by generators and…
Functor coalgebras capture a wide range of transition systems that must however evolve in discrete steps. We introduce graded coalgebras of graded monads and propose them to model continuous-time transition systems. We develop the theory of…
This paper studies the homotopy theory of the Grothendieck construction using model categories and semi-model categories, provides a unifying framework for the homotopy theory of operads and their algebras and modules, and uses this…
In two seminal papers M. Kontsevich introduced graph homology as a tool to compute the homology of three infinite dimensional Lie algebras, associated to the three operads `commutative,' `associative' and `Lie.' We generalize his theorem to…
We introduce a graph-theoretical representation of proofs of multiplicative linear logic which yields both a denotational semantics and a notion of truth. For this, we use a locative approach (in the sense of ludics) related to game…
Controllability and observability have long been recognized as fundamental structural properties of dynamical systems, but have recently seen renewed interest in the context of large, complex networks of dynamical systems. A basic problem…
We provide a new perspective on the divisor theory of graphs, using additive combinatorics. As a test case for this perspective, we compute the gonality of certain families of outerplanar graphs, specifically the strip graphs. The Jacobians…
We define a family of structures called "opetopic algebras", which are algebraic structures with an underlying opetopic set. Examples of such are categories, planar operads, and Loday's combinads over planar trees. Opetopic algebras can be…
More than two decades ago, combinatorial topology was shown to be useful for analyzing distributed fault-tolerant algorithms in shared memory systems and in message passing systems. In this work, we show that combinatorial topology can also…
The purpose of this foundational paper is to introduce various notions and constructions in order to develop the homotopy theory for differential graded operads over any ring. The main new idea is to consider the action of the symmetric…
We propose a combinatorial and graph-theoretic theory of dropout by modeling training as a random walk over a high-dimensional graph of binary subnetworks. Each node represents a masked version of the network, and dropout induces stochastic…
As the scale of networked control systems increases and interactions between different subsystems become more sophisticated, questions of the resilience of such networks increase in importance. The need to redefine classical system and…
This paper attempts to provide a more or less self-contained introduction into theory of the Grothendieck-Teichmueller group and Drinfeld associators using the theory of operads and graph complexes.
The vector space of all polygons with configurations of diagonals is endowed with an operad structure. This is the consequence of a functorial construction $\mathsf{C}$ introduced here, which takes unitary magmas $\mathcal{M}$ as input and…
Operads were originally defined as V-operads, that is, enriched in a symmetric or braided monoidal category V. The symmetry or braiding in V is required in order to describe the associativity axiom the operads must obey, as well as the…
In this article we consider combinatorial maps approach to graphs on surfaces, and how between them can be establish terminological uniformity in favor of combinatorial maps in way rotations are set as base structural elements and all other…
The coalgebraic modelling of alternating automata and of probabilistic automata has long been obstructed by the absence of distributive laws of the powerset monad over itself, respectively of the powerset monad over the finite distribution…
A fundamental problem from invariant theory is to describe the endomorphism algebra of multilinear functions on a representation V invariant under the action of a group G. According to Weyl's classic, a first main (later: fundamental)…
Classical spectral theory provides powerful tools for analyzing linear operators, but does not extend naturally to nonlinear or compositional settings. In particular, there is no general way to transport spectral invariants in a functorial…