Positivity of iterated sequences of polynomials
Bao-Xuan Zhu

TL;DR
This paper develops criteria for the positivity of iterated sequences of polynomials related to combinatorial arrays, enabling unified proofs of their q-log-convexity properties across many classical polynomial families.
Contribution
It introduces new criteria for q-log-convexity of polynomial sequences derived from recurrence relations, extending known results and unifying various cases through continued fractions and generating functions.
Findings
Criteria for 2-q-log-convexity and 3-q-log-convexity of polynomial sequences.
Unified treatment of log-convexity for multiple classical polynomials.
Extension of known results on q-log-convexity to broader polynomial families.
Abstract
In this paper, we present some criteria for the --log-convexity and --log-convexity of combinatorial sequences, which can be regarded as the first column of certain infinite triangular array of polynomials in with nonnegative coefficients satisfying the recurrence relation Those criterions can also be presented by continued fractions and generating functions. These allow a unified treatment of the --log-convexity of alternating Eulerian polynomials, -log-convexity of Euler numbers, and --log-convexity of many classical polynomials, including the Bell polynomials, the Eulerian polynomials of Types and , the -Schr\"{o}der numbers, -central Delannoy numbers, the Narayana polynomials of Types and , the generating functions of rows in the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Advanced Mathematical Identities · Mathematical functions and polynomials
