Skip to main content
SpringerLink
Log in

Treelike Structures

  • Chapter
  • First Online:
Nonsymmetric Operads in Combinatorics

  • 255 Accesses

Abstract

This second chapter is devoted to present general notions about treelike structures. We present more precisely the ones appearing in the algebraic and combinatorial context of nonsymmetric operads. Rewrite systems of syntax trees are exposed, as well as methods to prove their termination and their confluence.

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

Access this chapter

Log in via an institution
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. M.R. Bremner, V. Dotsenko, Algebraic Operads: An Algorithmic Companion (Chapman and Hall/CRC, London/Boca Raton, 2016), pp. xvii+365

    Google Scholar 

  2. A. Cayley, On the theory of the analytical forms called trees. Philos. Mag. 13, 172–176 (1857)

    Article  Google Scholar 

  3. C. Chenavier, C. Cordero, S. Giraudo, Generalizations of the associative operad and convergent rewrite systems. Higher Dimens. Rewriting Algebra (2018). https://doi.org/10.29007/mfnh

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

    Google Scholar 

  5. T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein, Introduction to Algorithms, 3rd edn. (The MIT Press, Cambridge, 2009)

    MATH  Google Scholar 

  6. V. Dotsenko, A. Khoroshkin, Gröbner bases for operads. Duke Math. J. 153(2), 363–396 (2010)

    Article  MathSciNet  Google Scholar 

  7. A. Dvoretzky, Th. Motzkin, A problem of arrangements. Duke Math. J. 14(2), 305–313 (1947)

    Article  MathSciNet  Google Scholar 

  8. K. Ebrahimi-Fard, D. Manchon, The Magnus expansion, trees and Knuth’s rotation correspondence. Found. Comput. Math. 14(1), 1–25 (2014)

    Article  MathSciNet  Google Scholar 

  9. P. Flajolet, R. Sedgewick, Analytic Combinatorics (Cambridge University Press, Cambridge, 2009)

    Book  Google Scholar 

  10. S. Giraudo, Operads from posets and Koszul duality. Eur. J. Comb. 56C, 1–32 (2016)

    Article  MathSciNet  Google Scholar 

  11. F. Hivert, J.-C. Novelli, J.-Y. Thibon, The algebra of binary search trees. Theor. Comput. Sci. 339(1), 129–165 (2005)

    Article  MathSciNet  Google Scholar 

  12. E. Hoffbeck, A Poincaré-Birkhoff-Witt criterion for Koszul operads. Manuscripta Math. 131(1-2), 87–110 (2010)

    Article  MathSciNet  Google Scholar 

  13. D. Knuth, The Art of Computer Programming. Fundamental Algorithms, 3rd edn., vol. 1 (Addison Wesley Longman, Boston, 1997), pp. xx+650

    Google Scholar 

  14. D. Knuth, The Art of Computer Programming. Sorting and Searching, vol. 3 (Addison Wesley Longman, Boston, 1998), pp. xiv+780

    Google Scholar 

  15. G. Labelle, Une nouvelle démonstration combinatoire des formules d’inversion de Lagrange. Adv. Math. 42(3), 217–247 (1981)

    Article  MathSciNet  Google Scholar 

  16. J.-L. Loday, M. Ronco, Hopf algebra of the planar binary trees. Adv. Math. 139, 293–309 (1998)

    Article  MathSciNet  Google Scholar 

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

    Book  Google Scholar 

  18. T.V. Narayana, Sur les treillis formés par les partitions d’un entier et leurs applications à la théorie des probabilités. C. R. Acad. Sci. Paris 240, 1188–1189 (1955)

    MathSciNet  MATH  Google Scholar 

  19. J.-C. Novelli, J.-Y. Thibon, Duplicial algebras and Lagrange inversion (2013). arXiv:1209.5959v2

  20. N.J.A. Sloane, The on-line encyclopedia of integer sequences (1996). https://oeis.org/

Download references

Author information

Authors and Affiliations

  1. University of Paris-Est, Marne-la-Vallee, France

    Samuele Giraudo

Authors
  1. Samuele Giraudo
    View author publications

    You can also search for this author in PubMed Google Scholar

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). Treelike Structures. In: Nonsymmetric Operads in Combinatorics. Springer, Cham. https://doi.org/10.1007/978-3-030-02074-3_3

Download citation

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

  • 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

Search

Navigation