Ramanujan grammar and Cayley trees

zbMath0852.05018MaRDI QIDQ1918894

Armand Ramamonjisoa, Dumont, Dominique

Publication date: 21 July 1996

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/118930

zbMATH Keywords

sequences of polynomialsdifferential operatorgrammarrooted treesCayley treesgraphs of mappingsRamanujan grammar

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Algebraic combinatorics (05E99) Enumerative combinatorics (05A99)

Related Items (15)

Trees, forests, and total positivity. I: \(q\)-trees and \(q\)-forests matrices ⋮ Arboretum for a generalisation of Ramanujan polynomials ⋮ Unnamed Item ⋮ A generalization of the Ramanujan polynomials and plane trees ⋮ A context-free grammar for peaks and double descents of permutations ⋮ Context-free grammars, generating functions and combinatorial arrays ⋮ Total positivity of some polynomial matrices that enumerate labeled trees and forests. I: Forests of rooted labeled trees ⋮ Context-free grammars for several polynomials associated with Eulerian polynomials ⋮ Bivariate generating functions for a class of linear recurrences: general structure ⋮ An exponential formula for polynomial vector fields. II: Lie series, exponential substitution, and rooted trees ⋮ A bijective proof of the Shor recurrence ⋮ A context-free grammar for the Ramanujan-Shor polynomials ⋮ Bijections behind the Ramanujan polynomials ⋮ Derivatives of the tree function ⋮ Fine structures inside the PreLie operad

This page was built for publication: Ramanujan grammar and Cayley trees