arXiv (All)
open access
Noetherian forms of free non-symmetric operads
In this paper, we study certain categories of labeled finite rooted ordered trees over a fixed set of labels where each label is equipped with an arity: a fixed number of children that the vertex with the given label must have. Equivalently, these are expression trees for operations in a free non-sy
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
- Automated Termination Proving : contributions to Graph Rewriting via Extended Weighted Type Graphs and Morphism Counting#370840
- Resolving subcategories for gentle algebras I: Monogeneous resolving subcategories for gentle trees#996863
- Monotone Bounded Depth Formula Complexity of Graph Homomorphism Polynomials#1129135
- The Talkative Tree#42181
- The Animals' Christmas Tree#61635
Record · ID 997373
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