Bijections behind the Ramanujan polynomials

DOI10.1006/AAMA.2001.0738MaRDI QIDQ5956770zbMATH OpenOpenAlexFDO

Authors William Y. C. Chen, Victor J. W. Guo

Publication date 16 January 2003

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0107024

zbMATH Keywords

bijectionimproper edgeRamanujan polynomialsrooted tree

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Abstract: The Ramanujan polynomials were introduced by Ramanujan in his study of power series inversions. In an approach to the Cayley formula on the number of trees, Shor discovers a refined recurrence relation in terms of the number of improper edges, without realizing the connection to the Ramanujan polynomials. On the other hand, Dumont and Ramamonjisoa independently take the grammatical approach to a sequence associated with the Ramanujan polynomials and have reached the same conclusion as Shor's. It was a coincidence for Zeng to realize that the Shor polynomials turn out to be the Ramanujan polynomials through an explicit substitution of parameters. Shor also discovers a recursion of Ramanujan polynomials which is equivalent to the Berndt-Evans-Wilson recursion under the substitution of Zeng, and asks for a combinatorial interpretation. The objective of this paper is to present a bijection for the Shor recursion, or and Berndt-Evans-Wilson recursion, answering the question of Shor. Such a bijection also leads to a combinatorial interpretation of the recurrence relation originally given by Ramanujan.

Recommendations

• A context-free grammar for the Ramanujan-Shor polynomials
• Arboretum for a generalisation of Ramanujan polynomials
• A generalization of the Ramanujan polynomials and plane trees
• A bijective proof of the Shor recurrence
• Ramanujan grammar and Cayley trees

Cites work

• A new proof of Cayley's formula for counting labeled trees
• A Ramanujan sequence that refines the Cayley formula for trees
• Chapter 3 of Ramanujan's second notebook
• Context-free grammars, differential operators and formal power series
• scientific article; zbMATH DE number 3884234 (Why is no real title available?)
• Ramanujan grammar and Cayley trees

Cited in

(11)

• A bijective proof of the Shor recurrence
• On a Hopf operad containing the Poisson operad
• A bijection which implies Melzer's polynomial identities: The \(\chi_{1,1}^{(p,p+1)}\) case
• A context-free grammar for the Ramanujan-Shor polynomials
• A generalization of the Ramanujan polynomials and plane trees
• A recursive algorithm for trees and forests
• Polynomial-Rational Bijections of R n
• A grammatical calculus for the Ramanujan polynomials
• Orbifold Euler characteristics of \({\overline{{{\mathcal{M}}}}}_{g,n} \)
• Derivatives of the tree function
• Arboretum for a generalisation of Ramanujan polynomials

This page was built for publication: Bijections behind the Ramanujan polynomials

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