A Ramanujan sequence that refines the Cayley formula for trees

DOI10.1023/A:1009809224933MaRDI QIDQ1288802zbMATH OpenOpenAlexFDO

Authors Jiang Zeng

Publication date 17 May 1999

Published in The Ramanujan Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1009809224933

zbMATH Keywords

Cayley's formulacounting trees

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Trees (05C05) Enumeration in graph theory (05C30) Special sequences and polynomials (11B83)

Review text

Using two entries of Ramanujan's second notebook a refinement of Cayley's formula for counting trees is proved, which generalizes a number of recent results in this direction.

Cited in

(15)

• A bijective proof of the Shor recurrence
• Ramanujan grammar and Cayley trees
• A context-free grammar for the Ramanujan-Shor polynomials
• A remark on the enumeration of rooted labeled trees
• A generalization of the Ramanujan polynomials and plane trees
• Bivariate generating functions for a class of linear recurrences: general structure
• Total positivity of some polynomial matrices that enumerate labeled trees and forests. I: Forests of rooted labeled trees
• Positivity properties of Jacobi-Stirling numbers and generalized Ramanujan polynomials
• A REFINEMENT FOR ORDERED LABELED TREES
• Bijections behind the Ramanujan polynomials
• A grammatical calculus for the Ramanujan polynomials
• Orbifold Euler characteristics of \({\overline{{{\mathcal{M}}}}}_{g,n} \)
• Derivatives of the tree function
• Trees, forests, and total positivity. I: \(q\)-trees and \(q\)-forests matrices
• Arboretum for a generalisation of Ramanujan polynomials

This page was built for publication: A Ramanujan sequence that refines the Cayley formula for trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1288802)