Set Operads in Combinatorics and Computer Science
From MaRDI portal
Recommendations
- Operads and algebraic combinatorics of trees
- Set theory and operator algebras
- Combinatorial N_ operads
- Nonsymmetric operads in combinatorics
- Operads of finite posets
- Combinatorial operads from monoids
- Combinatorial set theory of C^*-algebras
- From operads to dendroidal sets
- Sets and computations
- Combinatorial set theory
Cited in
(23)- Monops, monoids and operads: the combinatorics of Sheffer polynomials
- Combalgebraic structures on decorated cliques
- Operads of finite posets
- Colored operads, series on colored operads, and combinatorial generating systems
- Duality of graded graphs through operads
- Doubling bialgebras of finite topologies
- \(\infty\)-operads via symmetric sequences
- Enumeration of bipartite non-crossing geometric graphs
- Tree series and pattern avoidance in syntax trees
- Operads of finite labeled graphs
- Resolutions of convex geometries
- Cliff operads: a hierarchy of operads on words
- Compositional thermostatics
- Plethysms and operads
- Nonsymmetric operads in combinatorics
- A general construction of family algebraic structures
- Operad structures on the species composition of two operads
- Operads on graphs: extending the pre-Lie operad and general construction
- Algebraic aspects of connections: from torsion, curvature, and post-Lie algebras to Gavrilov's double exponential and special polynomials
- Clones of pigmented words and realizations of special classes of monoids
- Operads of poset matrices
- The algebraic structures of social organizations: the operad of cooperative games
- Structure theorems for dendriform and tridendriform algebras
This page was built for publication: Set Operads in Combinatorics and Computer Science
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3191540)
