A generalization of the Ramanujan polynomials and plane trees
From MaRDI portal
Publication:2383532
DOI10.1016/j.aam.2006.01.004zbMath1126.05014arXivmath/0512249OpenAlexW1969929962MaRDI QIDQ2383532
Publication date: 19 September 2007
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0512249
Trees (05C05) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)
Related Items
Trees, forests, and total positivity. I: \(q\)-trees and \(q\)-forests matrices ⋮ Arboretum for a generalisation of Ramanujan polynomials ⋮ Positivity properties of Jacobi-Stirling numbers and generalized Ramanujan polynomials ⋮ Total positivity of some polynomial matrices that enumerate labeled trees and forests. I: Forests of rooted labeled trees ⋮ An insertion algorithm and leaders of rooted trees ⋮ Disposition polynomials and plane trees ⋮ A recursive algorithm for trees and forests ⋮ A bijective proof of the Shor recurrence ⋮ Derivatives of the tree function
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A refinement of Cayley's formula for trees
- A Ramanujan sequence that refines the Cayley formula for trees
- On a Hopf operad containing the Poisson operad
- A new proof of Cayley's formula for counting labeled trees
- Ramanujan grammar and Cayley trees
- Opérades différentielles graduées sur les simplexes et les permutoèdres
- Bijections behind the Ramanujan polynomials