HAL (France)
open access
Operads on graphs: extending the pre-Lie operad and general construction
The overall aim of this paper is to define a structure of graph operads, thus generalizing the celebrated pre-Lie operad on rooted trees. More precisely, we define two operads on multigraphs, and exhibit a non-trivial correspondence between them and the pre-Lie and Kontsevich-Willwacher operads. We
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Category theory and the foundations of mathematics: Philosophical excavations#751067
- When higher-order interactions matter: reducibility, parsimony, and microscopic organization#1033819
- Maximum Matching Size for Bounded Arboricity Graphs in the Dynamic Graph Stream Model using $\tilde{O}(n^{2/3})$ space#1013339
- Work Stealing for the 2D-Mesh Topology of Satellite Constellations in Low Earth Orbit#271790
- Fragments from the Journal of a Solitary Man (From: "The Doliver Romance and Other Pieces: Tales and Sketches")#35472
Record · ID 796374
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive