Polynomial functors and trees
From MaRDI portal
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 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.
Recommendations
Cited in
(38)- Polynomial-lemniscates, trees and braids
- Decomposition spaces, incidence algebras and Möbius inversion. I: Basic theory
- Categorification of Hopf algebras of rooted trees.
- On semiflexible, flexible and pie algebras
- Higher cyclic operads
- The incidence comodule bialgebra of the Baez-Dolan construction
- Homotopy-coherent algebra via Segal conditions
- Modular operads and the nerve theorem
- Enriched \(\infty \)-operads
- Dynamical systems and sheaves
- Groupoids and Faà di Bruno formulae for Green functions in bialgebras of trees.
- Free algebras through Day convolution
- Graphs, hypergraphs, and properads
- Algebraic Kan extensions along morphisms of internal algebra classifiers
- Homotopy theory for algebras over polynomial monads
- Polynomial functors and combinatorial Dyson-Schwinger equations
- Data types with symmetries and polynomial functors over groupoids
- Monads with arities and their associated theories
- Polynomial functors and polynomial monads
- Faà di Bruno for operads and internal algebras
- Homotopy theory of algebras of substitudes and their localisation
- Syntactic approaches to opetopes
- Opetopic algebras I: Algebraic structures on opetopic sets
- Local dissymmetry on graphs and related algebraic structures
- Types for Proofs and Programs
- Moment categories and operads
- Partition complexes and trees
- A Thomason model structure on the category of small \(n\)-fold categories
- Categories of graphs for operadic structures
- Whole-grain Petri nets and processes
- Segal conditions for generalized operads
- Polynomials in homotopy type theory as a Kleisli category
- Triple delooping for multiplicative hyperoperads
- Quasi-tame substitudes and the Grothendieck construction
- Free decomposition spaces
- The Deligne-Mumford operad as a trivialization of the circle action
- Decomposition spaces in combinatorics
- Polynomial functors and opetopes
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)
