Set Operads in Combinatorics and Computer Science
From MaRDI portal
Publication:3191540
DOI10.1007/978-3-319-11713-3zbMath1338.18003OpenAlexW586378095MaRDI QIDQ3191540
Publication date: 2 October 2014
Published in: SpringerBriefs in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-11713-3
Exact enumeration problems, generating functions (05A15) Combinatorics in computer science (68R05) Research exposition (monographs, survey articles) pertaining to category theory (18-02)
Related Items
\(\infty\)-operads via symmetric sequences, Compositional thermostatics, Enumeration of bipartite non-crossing geometric graphs, Monops, monoids and operads: the combinatorics of Sheffer polynomials, Resolutions of convex geometries, Tree series and pattern avoidance in syntax trees, Plethysms and operads, Cliff operads: a hierarchy of operads on words, Combalgebraic structures on decorated cliques, Colored operads, series on colored operads, and combinatorial generating systems, Duality of graded graphs through operads, Doubling bialgebras of finite topologies, Structure theorems for dendriform and tridendriform algebras