Polynomial functors and trees

DOI10.1093/IMRN/RNQ068zbMATH Open1235.18007arXiv0807.2874OpenAlexW2006905582MaRDI QIDQ3079528FDOQ3079528

Authors: Joachim Kock 

Publication date: 2 March 2011

Published in: IMRN. International Mathematics Research Notices (Search for Journal in Brave)

Abstract: We explore the relationship between polynomial functors and (rooted) trees. In the first part we use polynomial functors to derive a new convenient formalism for trees, and obtain a natural and conceptual construction of the category $Omega$ of Moerdijk and Weiss; its main properties are described in terms of some factorisation systems. Although the constructions are motivated and explained in terms of polynomial functors, they all amount to elementary manipulations with finite sets. In the second part we describe polynomial endofunctors and monads as structures built from trees, characterising the images of several nerve functors from polynomial endofunctors and monads into presheaves on categories of trees. Polynomial endofunctors and monads over a base are characterised by a sheaf condition on categories of decorated trees. In the absolute case, one further condition is needed, a certain projectivity condition, which serves also to characterise polynomial endofunctors and monads among (coloured) collections and operads.

Full work available at URL: https://arxiv.org/abs/0807.2874

Recommendations

• Polynomial functors and polynomial monads
• A Linear Category of Polynomial Functors (extensional part)
• Categorification of Hopf algebras of rooted trees.
• Types for Proofs and Programs
• Polynomial functors and opetopes

zbMATH Keywords

decorated treespolynomial endofunctorspresheaves on categories of trees

Mathematics Subject Classification ID

Trees (05C05) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Presheaves and sheaves, stacks, descent conditions (category-theoretic aspects) (18F20)

Cited In (32)

• Whole-grain Petri nets and processes
• Types for Proofs and Programs
• Faà di Bruno for operads and internal algebras
• Categories of graphs for operadic structures
• Monads with arities and their associated theories
• Graphs, hypergraphs, and properads
• Syntactic approaches to opetopes
• Algebraic Kan extensions along morphisms of internal algebra classifiers
• Modular operads and the nerve theorem
• Partition complexes and trees
• Moment categories and operads
• Segal conditions for generalized operads
• The incidence comodule bialgebra of the Baez-Dolan construction
• Homotopy-coherent algebra via Segal conditions
• Groupoids and Faà di Bruno formulae for Green functions in bialgebras of trees.
• Higher cyclic operads
• Decomposition spaces, incidence algebras and Möbius inversion. I: Basic theory
• Data types with symmetries and polynomial functors over groupoids
• Polynomial functors and combinatorial Dyson-Schwinger equations
• A Thomason model structure on the category of small \(n\)-fold categories
• Polynomial functors and opetopes
• Polynomial-lemniscates, trees and braids
• Local dissymmetry on graphs and related algebraic structures
• Homotopy theory for algebras over polynomial monads
• Categorification of Hopf algebras of rooted trees.
• Dynamical systems and sheaves
• On semiflexible, flexible and pie algebras
• Free algebras through Day convolution
• Enriched \(\infty \)-operads
• Polynomial functors and polynomial monads
• Opetopic algebras I: Algebraic structures on opetopic sets
• Homotopy theory of algebras of substitudes and their localisation

This page was built for publication: Polynomial functors and trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3079528)