2014
DOI: 10.1090/s0002-9939-2014-12008-9
|View full text |Cite
|
Sign up to set email alerts
|

Some positivities in certain triangular arrays

Abstract: Let {T n,k } n,k≥0 be an array of nonnegative numbers satisfying the recurrence relationWe obtain some results for the total positivity of the matrix T n,k n,k≥0 , Pólya frequency properties of the row and column generating functions, and q-log-convexity of the row generating functions. This allows a unified treatment of the properties above for some triangular arrays of the second kind, including the Stirling triangle, Jacobi-Stirling triangle, Legendre-Stirling triangle, and central factorial numbers triang… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
27
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
8

Relationship

3
5

Authors

Journals

citations
Cited by 33 publications
(29 citation statements)
references
References 22 publications
2
27
0
Order By: Relevance
“…By Theorem 1.3, we have the following generalization, which in particular confirms Conjecture 1.1 for Jacobi-Stirling numbers of the second kind. [46], we derive that [Jc k n (z)] n,k is totally positive, also see [33]. Thus by Theorem 1.2, we also have the following result, which in particular confirms Conjecture 1.1 for Jacobi-Stirling numbers of the first kind.…”
Section: Jacobi-stirling Transformation Of the Second Kindsupporting
confidence: 77%
See 1 more Smart Citation
“…By Theorem 1.3, we have the following generalization, which in particular confirms Conjecture 1.1 for Jacobi-Stirling numbers of the second kind. [46], we derive that [Jc k n (z)] n,k is totally positive, also see [33]. Thus by Theorem 1.2, we also have the following result, which in particular confirms Conjecture 1.1 for Jacobi-Stirling numbers of the first kind.…”
Section: Jacobi-stirling Transformation Of the Second Kindsupporting
confidence: 77%
“…Zhu [46] proved that the row generating functions of U(n, k) (respectively, V (n, k)) form a strongly q-log-convex sequence. In view of Theorem 1.3, these can be extended to the following result.…”
Section: Central Factorial Transformationsmentioning
confidence: 99%
“…The Bell polynomials are given by B n+1 (q) = k 0 S n+1,k x k , where S n,k are the Stirling numbers of the second kind. It has been shown that the polynomials B n (q) form a strongly q-log-convex sequence (see, for instance, [18,42,43]). Note that B n+1 (q) = n k=0 n k B n (q).…”
Section: B-x Zhumentioning
confidence: 99%
“…where T n,k = 0 unless 0 k n. Two known results for the strong q-log-convexity of the generating functions of row sequences of [T n,k ] n,k 0 , for a 1 = b 1 = 0 and for A = B = 0, respectively, were proved by Chen et al . [18] and Zhu [43]. Therefore, we also consider a similar problem for the above special interesting Riordan arrays (see theorem 3.4).…”
Section: Introductionmentioning
confidence: 99%
“…However, the converse dose not follows. As we know that many famous polynomials sequences, such as the Bell polynomials [10,19], the classical Eulerian polynomials [19,25], the Narayana polynomials [9], the Narayana polynomials of type B [8] and the Jacobi-Stirling numbers [17,26], are q-log-convex. Furthermore, almost all of these polynomials sequences are strongly q-logconvex [10,17,25].…”
Section: Introductionmentioning
confidence: 99%