16 research outputs found
Recurrence Relations for Strongly q-Log-Convex Polynomials
We consider a class of strongly q-log-convex polynomials based on a
triangular recurrence relation with linear coefficients, and we show that the
Bell polynomials, the Bessel polynomials, the Ramanujan polynomials and the
Dowling polynomials are strongly q-log-convex. We also prove that the Bessel
transformation preserves log-convexity.Comment: 15 page
A Generalization of the Ramanujan Polynomials and Plane Trees
Generalizing a sequence of Lambert, Cayley and Ramanujan, Chapoton has
recently introduced a polynomial sequence Q_n:=Q_n(x,y,z,t) defined by Q_1=1,
Q_{n+1}=[x+nz+(y+t)(n+y\partial_y)]Q_n. In this paper we prove Chapoton's
conjecture on the duality formula: Q_n(x,y,z,t)=Q_n(x+nz+nt,y,-t,-z), and
answer his question about the combinatorial interpretation of Q_n. Actually we
give combinatorial interpretations of these polynomials in terms of plane
trees, half-mobile trees, and forests of plane trees. Our approach also leads
to a general formula that unifies several known results for enumerating trees
and plane trees.Comment: 20 pages, 2 tables, 8 figures, see also
http://math.univ-lyon1.fr/~gu
Bijections behind the Ramanujan Polynomials
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.Comment: 18 pages, 7 figure
Recurrence Relations for Strongly q-Log-Convex Polynomials
We consider a class of strongly q-log-convex polynomials based on a
triangular recurrence relation with linear coefficients, and we show that the
Bell polynomials, the Bessel polynomials, the Ramanujan polynomials and the
Dowling polynomials are strongly q-log-convex. We also prove that the Bessel
transformation preserves log-convexity.Comment: 15 page
Bivariate generating functions for a class of linear recurrences: General structure
We consider Problem 6.94 posed in the book Concrete Mathematics by Graham, Knuth, and Patashnik, and solve it by using bivariate exponential generating functions. The family of recurrence relations considered in the problem contains many cases of combinatorial interest for particular choices of the six parameters that define it. We give a complete classification of the partial differential equations satisfied by the exponential generating functions, and solve them in all cases. We also show that the recurrence relations defining the combinatorial numbers appearing in this problem display an interesting degeneracy that we study in detail. Finally, we obtain for all cases the corresponding univariate row generating polynomials.We are indebted to Alan Sokal for his participation in the early stages of this work, and his encouragement and useful suggestions later on. We also thank Jesper Jacobsen, Anna de Mier, Neil Sloane, and Mike Spivey for correspondence, and David Callan for pointing out some interesting references to us. This research has been supported in part by Spanish MINECO grant FIS2012-34379. The research of J.S. has also been supported in part by Spanish MINECO grant MTM2011-24097 and by U.S. National Science Foundation grant PHY-0424082