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.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
M.R. Bremner, V. Dotsenko, Algebraic Operads: An Algorithmic Companion (Chapman and Hall/CRC, London/Boca Raton, 2016), pp. xvii+365
A. Cayley, On the theory of the analytical forms called trees. Philos. Mag. 13, 172–176 (1857)
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
F. Chapoton, Operads and algebraic combinatorics of trees. Sém. Lothar. Combin. B58c, 27 (2008)
T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein, Introduction to Algorithms, 3rd edn. (The MIT Press, Cambridge, 2009)
V. Dotsenko, A. Khoroshkin, Gröbner bases for operads. Duke Math. J. 153(2), 363–396 (2010)
A. Dvoretzky, Th. Motzkin, A problem of arrangements. Duke Math. J. 14(2), 305–313 (1947)
K. Ebrahimi-Fard, D. Manchon, The Magnus expansion, trees and Knuth’s rotation correspondence. Found. Comput. Math. 14(1), 1–25 (2014)
P. Flajolet, R. Sedgewick, Analytic Combinatorics (Cambridge University Press, Cambridge, 2009)
S. Giraudo, Operads from posets and Koszul duality. Eur. J. Comb. 56C, 1–32 (2016)
F. Hivert, J.-C. Novelli, J.-Y. Thibon, The algebra of binary search trees. Theor. Comput. Sci. 339(1), 129–165 (2005)
E. Hoffbeck, A Poincaré-Birkhoff-Witt criterion for Koszul operads. Manuscripta Math. 131(1-2), 87–110 (2010)
D. Knuth, The Art of Computer Programming. Fundamental Algorithms, 3rd edn., vol. 1 (Addison Wesley Longman, Boston, 1997), pp. xx+650
D. Knuth, The Art of Computer Programming. Sorting and Searching, vol. 3 (Addison Wesley Longman, Boston, 1998), pp. xiv+780
G. Labelle, Une nouvelle démonstration combinatoire des formules d’inversion de Lagrange. Adv. Math. 42(3), 217–247 (1981)
J.-L. Loday, M. Ronco, Hopf algebra of the planar binary trees. Adv. Math. 139, 293–309 (1998)
J.-L. Loday, B. Vallette, Algebraic Operads. Grundlehren der mathematischen Wissenschaften, vol. 346 (Springer, Heidelberg, 2012), pp. xxiv+634
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)
J.-C. Novelli, J.-Y. Thibon, Duplicial algebras and Lagrange inversion (2013). arXiv:1209.5959v2
N.J.A. Sloane, The on-line encyclopedia of integer sequences (1996). https://oeis.org/
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this chapter
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)