Skip to main content

Applications and Generalizations

  • Chapter
  • First Online:
Nonsymmetric Operads in Combinatorics
  • 248 Accesses

Abstract

This last chapter is devoted to review some applications of the theory of operads for enumerative prospects. To this aim, we present formal power series on operads, generalizing usual generating series. We also provide an overview on enrichments of operads: colored operads, cyclic operads, symmetric operads, and pros.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. J.-P. Bultel, S. Giraudo, Combinatorial Hopf algebras from PROs. J. Algebraic Combin. 44(2), 455–493 (2016)

    Article  MathSciNet  Google Scholar 

  2. S. Bozapalidis, Context-free series on trees. Inf. Comput. 169(2), 186–229 (2001)

    Article  MathSciNet  Google Scholar 

  3. J. Berstel, C. Reutenauer, Recognizable formal power series on trees. Theor. Comput. Sci. 18(2), 115–148 (1982)

    Article  MathSciNet  Google Scholar 

  4. J. Berstel, C. Reutenauer, Noncommutative Rational Series with Applications, vol. 137 (Cambridge University Press, Cambridge, 2010), pp. xiv+248

    Google Scholar 

  5. J.M. Boardman, R.M. Vogt, Homotopy invariant algebraic structures on topological spaces. Lecture Notes in Mathematics, vol. 347 (Springer, Berlin, 1973)

    Book  Google Scholar 

  6. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, C. Löding, D. Lugiez, S. Tison, M. Tommasi, Tree Automata Techniques and Applications (2007). http://www.grappa.univ-lille3.fr/tata

  7. F. Chapoton, Un théorème de Cartier-Milnor-Moore-Quillen pour les bigèbres dendriformes et les algèbres braces. J. Pure Appl. Algebra 168(1), 1–18 (2002)

    Article  MathSciNet  Google Scholar 

  8. F. Chapoton, Operads and algebraic combinatorics of trees. Sém. Lothar. Combin. B58c, 27 (2008)

    Google Scholar 

  9. F. Chapoton, A rooted-trees q-series lifting a one-parameter family of Lie idempotents. Algebra & Number Theory 3(6), 611–636 (2009)

    Article  MathSciNet  Google Scholar 

  10. P.-L. Curien, J. Obradović, A formal language for cyclic operads. Higher Struct. 1(1), 2255 (2017)

    Google Scholar 

  11. C. Cordero, Enumerative combinatorics of prographs, in Formal Power Series and Algebraic Combinatorics (2018)

    Google Scholar 

  12. S. Eilenberg, Automata, Languages, and Machines. Vol. A. Pure and Applied Mathematics, vol. 58. (Academic Press, New York, 1974), pp. xvi+451

    Google Scholar 

  13. A. Frabetti, Groups of tree-expanded series. J. Algebra 319(1), 377–413 (2008)

    Article  MathSciNet  Google Scholar 

  14. S. Giraudo, Colored operads, series on colored operads, and combinatorial generating systems (2016). arXiv:1605.04697v1

  15. E. Getzler, M.M. Kapranov, Cyclic operads and cyclic homology, in Geometry, Topology, & Physics. Conference Proceedings and Lecture Notes in Geometry and Topology, vol. IV (International Press, Cambridge, 1995), pp. 167–201

    Google Scholar 

  16. M.A. Harrison, Introduction to Formal Language Theory (Addison-Wesley Publishing Co., Reading, 1978), pp. xiv+594

    Google Scholar 

  17. J.E. Hopcroft, R. Matwani, J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, 3rd edn. (Pearson, London, 2006)

    Google Scholar 

  18. A. Khoroshkin, D. Piontkovski, On generating series of finitely presented operads. J. Algebra 426, 377–429 (2015)

    Article  MathSciNet  Google Scholar 

  19. Y. Lafont, Towards an algebraic theory of Boolean circuits. J. Pure Appl. Algebra 184(2-3), 257–310 (2003)

    Article  MathSciNet  Google Scholar 

  20. Y. Lafont, Diagram rewriting and operads. Sémin. Congr. 26, 163–179 (2011)

    MathSciNet  MATH  Google Scholar 

  21. T. Leinster, Higher Operads, Higher Categories. London Mathematical Society Lecture Note Series, vol. 298 (Cambridge University Press, Cambridge, 2004), pp. xiv+433

    Google Scholar 

  22. É. Laugerotte, J.-G. Luque, L. Mignot, F. Nicart, Multilinear representations of free PROs (2018). arXiv:1803.00228v1

  23. J.-L. Loday, N.M. Nikolov, Operadic construction of the renormalization group, in Lie Theory and Its Applications in Physics. Springer Proceedings in Mathematics and Statistics, vol. 36 (Springer, Tokyo, 2013), pp. 191–211

    Chapter  Google Scholar 

  24. J.-L. Loday, Dialgebras, in Dialgebras and Related Operads. Lecture Notes in Mathematics, vol. 1763 (Springer, Berlin, 2001), pp. 7–66

    Google Scholar 

  25. J.-L. Loday, Completing the operadic butterfly. Georgian Math. J. 13(4), 741–749 (2006)

    MathSciNet  MATH  Google Scholar 

  26. J.-L. Loday, B. Vallette, Algebraic Operads. Grundlehren der mathematischen Wissenschaften, vol. 346 (Springer, Heidelberg, 2012), pp. xxiv+634

    Book  Google Scholar 

  27. M. Markl, Operads and PROPs, in Handbook of Algebra, vol. 5 (Elsevier/North-Holland, Amsterdam, 2008), pp. 87–140

    MATH  Google Scholar 

  28. M.A. Méndez, Set Operads in Combinatorics and Computer Science. SpringerBriefs in Mathematics (Springer, Cham, 2015), pp. xvi+129

    Google Scholar 

  29. S.M. Lane, Categorical algebra. Bull. Am. Math. Soc. 71, 40–106 (1965)

    Article  MathSciNet  Google Scholar 

  30. J. Sakarovitch, Elements of Automata Theory (Cambridge University Press, Cambridge, 2009)

    Book  Google Scholar 

  31. A. Salomaa, M. Soittola, Automata-Theoretic Aspects of Formal Power Series. Texts and Monographs in Computer Science (Springer, New York, 1978), pp. x+171

    Book  Google Scholar 

  32. P. van der Laan, Operads: Hopf Algebras and Coloured Koszul Duality, Ph.D. thesis, Universiteit Utrecht, 2004

    Google Scholar 

  33. D. Yau, Colored Operads. Graduate Studies in Mathematics (American Mathematical Society, Providence, 2016)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Giraudo, S. (2018). Applications and Generalizations. In: Nonsymmetric Operads in Combinatorics. Springer, Cham. https://doi.org/10.1007/978-3-030-02074-3_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-02074-3_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-02073-6

  • Online ISBN: 978-3-030-02074-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics