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 Catalan triangles of Aigner and Shapiro, the generating functions of rows in the large Schr"oder triangle, and so on, which extend many known results for -log-convexity.

生成讲解博客的中文版本

生成AI智能校验的中文版本