Tree series and pattern avoidance in syntax trees
From MaRDI portal
Publication:2194759
DOI10.1016/j.jcta.2020.105285zbMath1447.05108arXiv1903.00677OpenAlexW2920477253MaRDI QIDQ2194759
Publication date: 7 September 2020
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.00677
Trees (05C05) Permutations, words, matrices (05A05) Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Operads (general) (18M60)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inversion of integral series enumerating planar trees
- Gröbner bases for operads
- Pattern avoidance in binary trees
- Koszul duality for operads
- Trees and jumps and real roots.
- Cofree Hopf algebras.
- Colored operads, series on colored operads, and combinatorial generating systems
- Supertrees
- On generating series of finitely presented operads
- Combinatorial operads from monoids
- Operads and algebraic combinatorics of trees
- A Poincaré-Birkhoff-Witt criterion for Koszul operads
- L-Algebras, Triplicial-Algebras, within an Equivalence of Categories Motivated by Graphs
- Set Operads in Combinatorics and Computer Science
- On the structure of cofree Hopf algebras
- An Inversion Theorem for Cluster Decompositions of Sequences with Distinguished Subsequences
- The Goulden—Jackson cluster method: extensions, applications and implementations
- Pattern Avoidance in Ternary Trees
- The Anticyclic Operad of Moulds
- Algebraic Operads
- Nonsymmetric operads in combinatorics