Next Article in Journal
Towards Dynamic Fuzzy Rule Interpolation via Density-Based Rule Promotion from Interpolated Outcomes
Previous Article in Journal
Spatio-Temporal Dual Kriging with Adaptive Coefficient Drift Function
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Tricomi Continuants

by
Emanuele Munarini
Dipartimento di Matematica, Politecnico di Milano, Piazza Leonardo da Vinci 32, 20133 Milano, Italy
Mathematics 2024, 12(3), 401; https://doi.org/10.3390/math12030401
Submission received: 29 November 2023 / Revised: 20 January 2024 / Accepted: 22 January 2024 / Published: 26 January 2024

Abstract

:
In this paper, we introduce and study the Tricomi continuants, a family of tridiagonal determinants forming a Sheffer sequence closely related to the Tricomi polynomials and the Laguerre polynomials. Specifically, we obtain the main umbral operators associated with these continuants and establish some of their basic relations. Then, we obtain a Turan-like inequality, some congruences, some binomial identities (including a Carlitz-like identity), and some relations with the Cayley continuants. Furthermore, we show that the infinite Hankel matrix generated by the Tricomi continuants has an LDU-Sheffer factorization, while the infinite Hankel matrix generated by the shifted Tricomi continuants has an LTU-Sheffer factorization. Finally, by the first factorization, we obtain the linearization formula for the Tricomi continuants and its inverse.

1. Introduction

In 1951, Tricomi [1] considered a sequence { n ( α ) ( x ) } n N of non-orthogonal polynomials related to the generalized Laguerre polynomials. These polynomials satisfy the three-term recurrence
( n + 1 ) n + 1 ( α ) ( x ) ( α + n ) n ( α ) ( x ) + x n 1 ( α ) ( x ) = 0
with the initial values 0 ( α ) ( x ) = 1 and 1 ( α ) ( x ) = α and have ordinary generating series
( α ) ( x ; t ) = n 0 n ( α ) ( x ) t n = ( 1 t ) x α e x t .
They have degree n / 2 (for a generic parameter α ) and can be expressed as
n ( α ) ( x ) = k = 0 n x α k ( 1 ) k x n k ( n k ) ! .
Tricomi polynomials have been studied from several points of view [2,3,4,5]. Here, we will show that they are related to the following tridiagonal determinants (continuants [6,7]). Consider the n × n determinants
T n ( ν ) ( x ) = x 1 ν x + 1 1 2 ν x + 2 1 ( n 2 ) ν x + n 2 1 ( n 1 ) ν x + n 1 n × n .
For the first values of n, we have
T 0 ( ν ) ( x ) = 1 T 1 ( ν ) ( x ) = x T 2 ( ν ) ( x ) = x 2 + x ν T 3 ( ν ) ( x ) = x 3 + 3 x 2 + ( 2 3 ν ) x 2 ν T 4 ( ν ) ( x ) = x 4 + 6 x 3 + ( 11 6 ν ) x 2 + ( 6 14 ν ) x + 3 ν ( ν 2 ) T 5 ( ν ) ( x ) = x 5 + 10 x 4 + 5 ( 7 2 ν ) x 3 + 50 ( 1 ν ) x 2 + ( 15 ν 2 70 ν + 24 ) x + 4 ν ( 5 ν 6 ) .
These determinants are monic polynomials of degree n (for any parameter ν ) and satisfy the recurrence
T n + 2 ( ν ) ( x ) = ( x + n + 1 ) T n + 1 ( ν ) ( x ) ( n + 1 ) ν T n ( ν ) ( x )
with the initial values T 0 ( ν ) ( x ) = 1 and T 1 ( ν ) ( x ) = x . From this recurrence, it is straightforward to obtain the exponential generating series
T ( ν ) ( x ; t ) = n 0 T n ( ν ) ( x ) t n n ! = e ν t ( 1 t ) x ν .
By comparing series (1) and (3), we have T n ( ν ) ( x ) = n ! n ( x ) ( ν ) . For this reason, we call these polynomials Tricomi continuants. Clearly, also the Tricomi continuants can be expressed in terms of the Laguerre polynomials. Specifically, considering the Laguerre polynomials as defined in [8], p. 108, we have the exponential generating series
n 0 L n ( α ) ( x ) t n n ! = e x t 1 t ( 1 t ) α + 1
and by formula (19) in [9], Volume II, p. 189,
n 0 L n ( α n ) ( x ) t n n ! = ( 1 + t ) α e x t .
Then, from series (3) and (5), we have
T n ( ν ) ( x ) = ( 1 ) n L n ( x + ν n ) ( ν )
or, more explicitly,
T n ( ν ) ( x ) = k = 0 n n k ν n k ( x ν ) k
where ( x ) n = x ( x + 1 ) ( x + 2 ) ( x + n 1 ) is the Pochhammer symbol (rising factorial).
Furthermore, from series (3), we have that the Tricomi continuants form a Sheffer sequence. More precisely, they form the Steffensen sequence (cross-sequence) associated with the Sheffer matrix
T ( ν ) = T n , k ( ν ) n , k 0 = ( 1 t ) ν e ν t , log 1 1 t .
For ν Z , these matrices have integer entries (as can be easily deduced from formula (6)). For instance, for ν = 1 , 1 , we have the (north-west partial) matrices
T 5 ( 1 ) = 1 0 0 0 0 0 0 1 0 0 0 0 1 1 1 0 0 0 2 5 3 1 0 0 9 20 17 6 1 0 44 109 100 45 10 1 , T 5 ( 1 ) = 1 0 0 0 0 0 0 1 0 0 0 0 1 1 1 0 0 0 2 1 3 1 0 0 3 8 5 6 1 0 4 31 0 25 10 1 .
Moreover, if ν = 0 , we have T n ( ν ) ( x ) = ( x ) n and then T ( 0 ) is the Sheffer matrix of the Stirling numbers of the first kind.
In this paper, we will investigate various combinatorial and algebraic properties of the Tricomi continuants. More precisely, in Section 2 we recall the basic definitions and properties of the Sheffer sequences and matrices. In Section 3, we obtain the main umbral operators associated with the Tricomi continuants. Then, by using these operators, we establish some basic relations for these continuants and their derivatives. In Section 4, we obtain a binomial identity from which we will deduce a Turan-like inequality. In Section 5, we derive some congruences for the Tricomi continuants and their derivatives. In Section 6, we consider the polynomials T n ( ν + μ n ) ( x + μ n ) and obtain their exponential generating series, proving that they still form a Sheffer sequence. In Section 7, we establish a two-parameter binomial identity similar to the symmetric Carlitz identity for the Bernoulli numbers. In Section 8, we obtain some relations between the Tricomi continuants and the Cayley continuants (another classical family of continuants also forming a Sheffer sequence). In Section 9, we show that the infinite Hankel matrix generated by the Tricomi continuants admits an LDU-Sheffer factorization. Similarly, we show that the infinite Hankel matrix generated by the shifted Tricomi continuants admits an LTU-Sheffer factorization. Furthermore, by the first factorization, we obtain the linearization formula for the Tricomi continuants and its inverse. Finally, in Section 10, we obtain some representations in terms of the Stirling numbers.

2. Sheffer Sequences and Sheffer Matrices

Sheffer sequences form an important class of polynomial sequences appearing in several fields of mathematics, especially in analysis, combinatorics, and umbral calculus [8,10,11,12,13,14,15,16]. In what follows, we recall the main definitions and properties we will need in the present paper. See [17] for a historical account.
A Sheffer sequence [18] is a polynomial sequence { s n ( x ) } n 0 having exponential generating series
s ( x ; t ) = n 0 s n ( x ) t n n ! = g ( t ) e x f ( t )
where g ( t ) = n 0 g n t n n ! and f ( t ) = n 0 f n t n n ! are two exponential series with g 0 = 1 , f 0 = 0 , and f 1 0 . In this case, the Sheffer sequence { s n ( x ) } n 0 has spectrum ( g ( t ) , f ( t ) ) .
An Appell sequence [19] is a Sheffer sequence with spectrum ( g ( t ) , t ) . A Steffensen sequence [16] is a Sheffer sequence { s n ( ν ) ( x ) } n 0 , depending on a parameter ν , with spectrum ( g ( t ) h ( t ) ν , f ( t ) ) , where h ( t ) = n 0 h n t n n ! is an exponential series with h 0 = 1 . Each Steffensen sequence is a cross-sequence [13,14], since it satisfies the binomial identity
k = 0 n n k s k ( μ ) ( x ) s n k ( ν ) ( y ) = s n ( μ + ν ) ( x + y ) .
A Sheffer matrix S = [ s n , k ] n , k 0 = ( g ( t ) , f ( t ) ) is an infinite lower triangular matrix such that
n k s n , k t n n ! = g ( t ) f ( t ) k k !
for two exponential series g ( t ) = n 0 g n t n n ! and f ( t ) = n 0 f n t n n ! , with g 0 = 1 , f 0 = 0 and f 1 0 . The entries of the matrix S satisfy the recurrence
s n + 1 , k + 1 = n + 1 k + 1 i = 0 n k k + i k a i s n , k + i
where the a n are the coefficients of the series a ( t ) = t / f ^ ( t ) = n 0 a n t n n ! , where f ^ ( t ) is the compositional inverse of f ( t ) .
Clearly, the row polynomials of the Sheffer matrix S = [ s n , k ] n , k 0 = ( g ( t ) , f ( t ) ) form the Sheffer sequence { s n ( x ) } n 0 with spectrum ( g ( t ) , f ( t ) ) , and vice versa.
The Sheffer matrices form a group with respect to the matrix multiplication (as happens for the analogous Riordan matrices [20,21]). More precisely, the product of two Sheffer matrices S 1 = ( g 1 ( t ) , f 1 ( t ) ) and S 2 = ( g 2 ( t ) , f 2 ( t ) ) is given by
S 1 S 2 = ( g 1 ( t ) g 2 ( f 1 ( t ) ) , f 2 ( f 1 ( t ) ) ) ,
the identity matrix is I = ( 1 , t ) and the inverse of a Sheffer matrix S = ( g ( t ) , f ( t ) ) is the Sheffer matrix
S 1 = ( g ( f ^ ( t ) ) 1 , f ^ ( t ) ) .
Given a Sheffer matrix S = [ s n , k ] n , k 0 and its inverse S 1 = [ s ^ n , k ] n , k 0 , we have the inversion theorem: given any two sequences { u n } n 0 and { v n } n 0 , we have
u n = k = 0 n s n , k v k v n = k = 0 n s ^ n , k u k .
Consider, for instance, the generalized Stirling numbers of the first kind s n , k ( μ ) and the generalized Stirling numbers of the second kind S n , k ( μ ) , defined as the entries of the following Sheffer matrices [22,23]
1 ( 1 t ) μ , log 1 1 t = s n , k ( μ ) n , k 0 and e μ t , e t 1 = S n , k ( μ ) n , k 0 .
These matrices are related to each other by the following identities
1 ( 1 t ) μ , log 1 1 t 1 = ( e μ t , 1 e t ) = ( 1 ) n k S n , k ( μ ) n , k 0 ( e μ t , e t 1 ) 1 = 1 ( 1 + t ) μ , log 1 1 + t = ( 1 ) n k s n , k ( μ ) n , k 0 .
Hence, we have the Stirling inversion theorem
u n = k = 0 n S n , k ( μ ) v k v n = k = 0 n ( 1 ) n k s n , k ( μ ) u k .
or
u n = k = 0 n s n , k ( μ ) v k v n = k = 0 n ( 1 ) n k S n , k ( μ ) u k .
Given a Sheffer matrix S = [ s n , k ] n , k 0 = ( g ( t ) , f ( t ) ) , we have
S ¯ = ( g ( t ) , f ( t ) ) = ( 1 ) n k s n , k n , k 0
or S ¯ = M S M , where M = ( 1 , t ) . A Sheffer matrix S is a pseudo-involution when S 1 = S ¯ , or, equivalently, when S M is an involution. For these matrices, we have the following inversion theorem: given any two sequences { u n } n 0 and { v n } n 0 , we have
u n = k = 0 n s n , k v k v n = k = 0 n ( 1 ) n k s n , k u k .
For instance, the binomial matrix
B ( q ) = n k q n k n , k 0 = 1 1 q t , t 1 q t
is a pseudo-involution. In this case, we have the binomial inversion theorem
u n = k = 0 n n k q n k v k v n = k = 0 n n k ( q ) n k u k .
Also the Lah matrix
L = n k n , k 0 = 1 , t 1 t ,
whose entries are the (signless) Lah numbers, is a pseudo-involution. In this case, we have the Lah inversion theorem
u n = k = 0 n n k v k v n = k = 0 n n k ( 1 ) n k u k .
Given a Sheffer matrix S = [ s n , k ] n , k 0 = ( g ( t ) , f ( t ) ) , the Sheffer transform T S of an exponential series h ( t ) = n 0 h n t n n ! is the exponential series given by
T S h ( t ) = ( g ( t ) , f ( t ) ) h ( t ) = g ( t ) h ( f ( t ) ) = n 0 k = 0 n s n , k h k t n n ! .
By Pincherle’s theorem [24], every linear operator L : R [ x ] R [ x ] can be represented by means of an exponential series in the derivative D with respect to x. More precisely, there exists a unique polynomial sequence { L n ( x ) } n 0 , where L n ( x ) R [ x ] for every n N , such that
L p ( x ) = k 0 L k ( x ) k ! D k p ( x ) = k = 0 n L k ( x ) k ! p ( k ) ( x )
for every polynomial p ( x ) R [ x ] of degree n.
Given a polynomial sequence { p n ( x ) } n 0 , where each p n ( x ) R [ x ] has degree n, we can consider the linear operators J , M , N , A : R [ x ] R [ x ] defined, for every n N , by
J p n ( x ) = n p n 1 ( x ) , M p n ( x ) = p n + 1 ( x ) , N p n ( x ) = n p n ( x ) , A p n ( x ) = p n + 1 ( x ) n + 1 .
The operator J is the umbral derivative (or lowering operator, or annihilation operator), the operator M is the umbral shift (or raising operator, or creation operator), the operator N is the umbral theta operator, and the operator A is the Appell operator associated with the sequence { p n ( x ) } n 0 .
The umbral operators J, M, N, and A of a Sheffer sequence { s n ( x ) } n 0 with spectrum ( g ( t ) , f ( t ) ) are given by [8]
J = f ^ ( D )
M = g ( f ^ ( D ) ) g ( f ^ ( D ) ) + x f ( f ^ ( D ) )
N = M J = g ( f ^ ( D ) ) g ( f ^ ( D ) ) + x f ( f ^ ( D ) ) f ^ ( D )
A = a ( D ) = D f ^ ( D ) .
Some other important operators are the shift operator E λ defined by E λ p ( x ) = p ( x + λ ) and represented by E λ = e λ D , the forward difference operator Δ = E 1 = e D 1 , and the backward difference operator = 1 E 1 = 1 e D . Moreover, we have
D = log 1 1
D k k ! = 1 k ! log 1 1 k = i k i k i i !
where the coefficients n k are the Stirling numbers of the first kind.

3. Umbral Operators

In this section, we obtain the main umbral operators for the Tricomi continuants and then we deduce some basic relations. First of all, we have the following representation theorem.
Theorem 1.
The umbral operators for the Tricomi continuants are given by
J = 1 e D = 1 E 1
M = ν ( e D 1 ) + x e D = ( x ν ) E + ν
N = ( x ν ) E x + 2 ν ν E 1
A = D 1 e D = D 1 E 1
or, equivalently, by
J =
M = ( x ν ) Δ + x
N = ( x ν ) Δ + ν
A = 1 log 1 1 .
Moreover, the operators J, M, and N satisfy the relation
ν J + M N = x .
Proof. 
From spectrum (7), we have
g ( t ) = ( 1 t ) ν e ν t , f ( t ) = log 1 1 t , f ^ ( t ) = 1 e t , g ( t ) = ν t ( 1 t ) ν 1 e ν t , f ( t ) = 1 1 t , g ( t ) g ( t ) = ν t 1 t , g ( f ^ ( t ) ) g ( f ^ ( t ) ) = ν ( e t 1 ) , f ( f ^ ( t ) ) = e t , t f ^ ( t ) = t 1 e t .
It follows that, by formulas (15)–(18), we have identities (21)–(24), respectively. Then, using the definition of the difference operators, we have at once identities (25)–(27). To obtain identity (28), just use (19). □
Using these representations of the umbral operators, we can obtain several identities for the Tricomi continuants. For instance, we have the following ones.
Theorem 2.
The Tricomi continuants satisfy the relations
T n ( ν ) ( x ) T n ( ν ) ( x 1 ) = n T n 1 ( ν ) ( x )
T n + 1 ( ν ) ( x ) = ( x ν ) T n ( ν ) ( x + 1 ) + ν T n ( ν ) ( x )
( x ν ) T n ( ν ) ( x + 1 ) ( x + n 2 ν ) T n ( ν ) ( x ) ν T n ( ν ) ( x 1 ) = 0
T n + 1 ( ν ) ( x ) ( x + n ) T n ( ν ) ( x ) + n ν T n 1 ( ν ) ( x ) = 0
T n + 1 ( ν ) ( x ) T n + 1 ( ν ) ( x 1 ) = ( n + 1 ) T n ( ν ) ( x ) .
Proof. 
Relations (30)–(32) derive immediately from representations (21)–(23) and definitions (14). Similarly, relation (33) derives from (29). Finally, to obtain relation (34), just notice that, from (24), we have A = D . □
Remark 1.
Since J = , we have
k T n ( ν ) ( x ) = n k ̲ T n k ( ν ) ( x )
where n k ̲ = n ( n 1 ) ( n k + 1 ) . Hence, we have the identity
i = 0 k k i ( 1 ) i T n ( ν ) ( x i ) = n k ̲ T n k ( ν ) ( x )
which generalizes identity (30). In particular, for k = n (and replacing the index i by k), we have
k = 0 n n k ( 1 ) k T n ( ν ) ( x k ) = n ! .
Recall that the Bernoulli numbers B n and the harmonic numbers H n have generating series
B ( t ) = n 0 B n t n n ! = t e t 1 , H ( t ) = n 0 H n t n = 1 1 t log 1 1 t .
Then, we have the following further identities.
Theorem 3.
The Tricomi continuants satisfy the relations
T n ( ν ) ( x ) = k = 1 n n k ( k 1 ) ! T n k ( ν ) ( x )
T n + 1 ( ν ) ( x ) = ( n + 1 ) k = 0 n ( 1 ) k B k i = k n n i i k T n i ( ν ) ( x )
T n + 1 ( ν ) ( x ) = k = 0 n n + 1 k + 1 k ! T n k ( ν ) ( x )
T n + 1 ( ν ) ( x + 1 ) T n + 1 ( ν ) ( x ) = k = 0 n n + 1 k + 1 ( k + 1 ) ! H k T n k ( ν ) ( x )
T n ( ν ) ( x + 1 ) = k = 0 n n k k ! H k T n k ( ν ) ( x )
where the coefficients B n are the Bernoulli numbers and the coefficients H n are the harmonic numbers.
Proof. 
Identity (36) derives from (19) and (35). Then, from (24), we have A = B ( D ) and from this representation we have
T n + 1 ( ν ) ( x ) = ( n + 1 ) k = 0 n ( 1 ) k k ! B k D k T n ( ν ) ( x ) .
Then, by (20) and (35), we have relation (37). Similarly, from representation (28), we have relation (38). To obtain the fourth relation, notice that
1 = 1 e D e D = e D 1 = Δ .
Hence
Δ A = 1 1 log 1 1 = H ( ) .
This representation and (35) imply relation (39). Finally, by (34), relation (39) reduces to (40). □
Remark 2.
Consider the coefficients T n , k ( ν ) of the Sheffer matrix (7). Since
T k ( ν ) ( t ) = n k T n , k ( ν ) t n n ! = G ( ν ) ( t ) 1 k ! log 1 1 t k
and
G ( ν ) ( t ) = n 0 G n ( ν ) t n n ! = ( 1 t ) ν e ν t
where G n ( ν ) = T n , 0 ( ν ) , then we have
T n , k ( ν ) = i = k n n i i k G n i ( ν )
where the coefficients n k are the Stirling numbers of the first kind. Moreover, since
( 1 t ) T k + 1 ( ν ) ( t ) + ν t T k + 1 ( ν ) ( t ) + T k ( ν ) ( t ) = 0 ,
we have the recurrence
T n + 2 , k + 1 ( ν ) = T n + 1 , k ( ν ) + ( n + 1 ) T n + 1 , k + 1 ( ν ) ( n + 1 ) ν T n , k + 1 ( ν ) .
Furthermore, since a ( t ) = t / f ^ ( t ) = B ( t ) , recurrence (8) becomes
T n + 1 , k + 1 ( ν ) = n + 1 k + 1 i = 0 n k k + i k ( 1 ) i B i T n , k + i ( ν ) .
Finally, notice that from recurrence (42) we have
G n + 2 ( ν ) = ( n + 1 ) G n + 1 ( ν ) ( n + 1 ) ν G n ( ν )
with G 0 ( ν ) = 1 and G 1 ( ν ) = 0 . Thus, if ν 0 , then G n ( ν ) 0 for every n N . Consequently, by formula (41), we have T n , k ( ν ) 0 for every n , k N . In conclusion, if ν = m with m N , then the matrix T ( m ) has non-negative integer entries (as in the examples considered in the Introduction). All these matrices admit a combinatorial interpretation (which we omit here).

4. Turán-like Inequalities

A sequence { p n ( x ) } n N of real polynomials satisfies the Turán inequalities when p n + 1 ( x ) 2 p n + 2 ( x ) p n ( x ) > 0 for all x belonging to a suitable interval of R . Several classical polynomials satisfy these inequalities, such as the Legendre, Laguerre, Hermite, and ultraspherical polynomials [25,26]. Also, the Tricomi continuants satisfy some inequalities of this kind (but with the direction of the inequality reversed). To obtain such inequalities, we will use the following formula.
Theorem 4.
The Tricomi continuants satisfy the relation
T n + 2 ( ν ) ( x ) T n ( ν ) ( x ) T n + 1 ( ν ) ( x ) 2 = ( x ν ) k = 0 n n k ( n k ) ! ν n k T k ( ν ) ( x ) T k ( ν ) ( x + 1 ) .
Proof. 
Consider the determinants
y n = T n + 2 ( ν ) ( x ) T n + 1 ( ν ) ( x ) T n + 1 ( ν ) ( x ) T n ( ν ) ( x ) .
By recurrence (2) and by the properties of the determinants, we have
y n + 1 = ( n + 1 ) ν y n + T n + 1 ( ν ) ( x ) ( T n + 2 ( ν ) ( x ) ν T n + 1 ( ν ) ( x ) ) .
By relation (31), this identity becomes
y n + 1 = ( n + 1 ) ν y n + ( x ν ) T n + 1 ( ν ) ( x ) T n + 1 ( ν ) ( x + 1 ) .
This is a linear recurrence of the first order in the form y n + 1 = a n + 1 y n + b n + 1 , where a n = n ν and b n = ( x ν ) T n ( ν ) ( x ) T n ( ν ) ( x + 1 ) . The general solution of this recurrence is
y n = a n * y 0 + k = 1 n a n * a k * b k
where y 0 = x ν and a n * = a n a n 1 a 1 = n ! ν n . This implies formula (43). □
We can now proof the following inequalities.
Theorem 5.
If ν > 0 and x > ν , then
T n + 2 ( ν ) ( x ) T n ( ν ) ( x ) T n + 1 ( ν ) ( x ) 2 > 0 .
Proof. 
If ν > 0 and x > ν , then (6) implies T n ( ν ) ( x ) > 0 , and consequently T n ( ν ) ( x + 1 ) > 0 . Hence, by formula (43), we have inequality (44). □

5. Congruences

In this section, we will obtain some congruences for the polynomials T n ( ν ) ( x ) and T n ( ν ) ( x ) , which by formula (6) are polynomials with integer coefficients (considering ν as an arbitrary parameter). First, recall that, given two polynomials p ( x ) , q ( x ) Z [ x ] , we have p ( x ) q ( x ) ( mod p Z p [ x ] ) when the corresponding coefficients of p ( x ) and q ( x ) are congruent modulo p.
First of all, we have the following simple result.
Lemma 1.
Let p be a prime. Then T p ( ν ) ( x ) x p x + ν ( mod p Z p [ x ] ) .
Proof. 
If p is prime, by formula (6), we have (working in Z p [ x ] )
T p ( ν ) ( x ) = k = 0 p p k ν p k ( x ν ) k = ν p + ( x ν ) p .
Since ( x ) p = x + x p , we have ( x ν ) p = x + ν + ( x ν ) p = x + ν + x p ν p . This implies our congruence. □
More generally, we have the following theorem.
Theorem 6.
Let p be a prime. Then, for every n N , we have the congruence
T p + n ( ν ) ( x ) ( x p x + ν ) T n ( ν ) ( x ) ( mod p Z p [ x ] ) .
Proof. 
It is well-known that p + n k n k + n k p ( mod p ) for p prime and n N . Thus, by formula (6), we have (working in Z p [ x ] )
T p + n ( ν ) ( x ) = k = 0 p + n p + n k ν p + n k ( x ν ) k = k = 0 p + n n k + n k p ν p + n k ( x ν ) k = k = 0 n n k ν p + n k ( x ν ) k + k = p p + n n k p ν p + n k ( x ν ) k = ν p k = 0 n n k ν n k ( x ν ) k + k = 0 n n k ν n k ( x ν ) p + k = ν p T n ( ν ) ( x ) + k = 0 n n k ν n k ( x ν ) p ( x ν ) k = ( ν p + ( x ν ) p ) T n ( ν ) ( x ) .
As we observed in the proof of Lemma 1, we have T p ( ν ) ( x ) = ν p + ( x ν ) p . Thus, we have T p + n ( ν ) ( x ) = T p ( ν ) ( x ) T n ( ν ) ( x ) , and by Lemma 1 we have congruence (45). □
Theorem 6 can be generalized as follows.
Theorem 7.
Let p be a prime. Then, for every m , n , s N , s 1 , we have the congruences
T m p + n ( ν ) ( x ) ( x p x + ν ) m T n ( ν ) ( x ) ( mod p Z p [ x ] )
T m p s + n ( ν ) ( x ) ( x p s x p s 1 + ν p s 1 ) m T n ( ν ) ( x ) ( mod p Z p [ x ] ) .
Proof. 
Congruence (46) can be proved by induction on m, using congruence (45). Then, congruence (47) can be proved by induction on s, using congruence (46). □
Furthermore, we also have the following congruences.
Theorem 8.
Let p be a prime. Then, for every n N , we have the congruence
T p + n ( ν ) ( x ) ( x p x + ν ) T n ( ν ) ( x ) T n ( ν ) ( x ) ( mod p Z p [ x ] ) .
Proof. 
By formula (36), we have (always working in Z p [ x ] )
T p + n ( ν ) ( x ) = k = 1 p + n p + n k ( k 1 ) ! T p + n k ( ν ) ( x ) = k = 1 p + n n k + n k p ( k 1 ) ! T p + n k ( ν ) ( x ) = k = 1 n n k ( k 1 ) ! T p + n k ( ν ) ( x ) + k = p p + n n k p ( k 1 ) ! T p + n k ( ν ) ( x ) = ( x p x + ν ) k = 1 n n k ( k 1 ) ! T n k ( ν ) ( x ) + k = 0 n n k ( p + k 1 ) ! T n k ( ν ) ( x ) = ( x p x + ν ) T n ( ν ) ( x ) + ( p 1 ) ! T n ( ν ) ( x ) = ( x p x + ν ) T n ( ν ) ( x + 1 ) T n ( ν ) ( x + 1 )
where we have used congruence (6) and Wilson’s theorem ( p 1 ) ! 1 ( mod p ) . This proves congruence (48). □
Finally, Theorem 8 can be easily extended in the following way.
Theorem 9.
Let p be a prime. Then, for every m , n , s N , m , s 1 , we have the congruences
T m p + n ( ν ) ( x ) ( x p x + ν ) m T n ( ν ) ( x ) m ( x p x + ν ) m 1 T n ( ν ) ( x ) ( mod p Z p [ x ] ) T m p s + n ( ν ) ( x ) ( x p s x p s 1 + ν p s 1 ) m T n ( ν ) ( x ) ( mod p Z p [ x ] ) .

6. A Binomial Identity

Consider the polynomials T n ( ν + μ n ) ( x + μ n ) , where μ is an arbitrary parameter. To obtain their exponential generating series Q ( x ; t ) = n 0 T n ( ν + μ n ) ( x + μ n ) t n n ! , consider the bivariate generating series
n , k 0 T n ( ν + μ k ) ( x + μ k ) t n n ! u k = k 0 e ( ν + μ k ) t ( 1 t ) x ν u k = T ( ν ) ( x ; t ) 1 e μ t u .
Since Q ( x ; t ) is the diagonal of the above bivariate series, then by Cauchy’s integral theorem (see [27], p. 42, [28], or [29], p. 182), we have
Q ( x ; t ) = 1 2 π i T ( ν ) ( x ; z ) 1 e μ z t / z d z z = 1 2 π i T ( ν ) ( x ; z ) z t e μ z d z .
There is only one pole (of the first order) tending to 0 as t 0 , given by the unique (invertible) formal series ψ ( t ) , such that
ψ ( t ) = t e μ ψ ( t ) or ψ ^ ( t ) = t e μ t .
Hence, by the residue theorem, we have
Q ( x ; t ) = lim z ψ ( t ) ( z ψ ( t ) ) T ( ν ) ( x ; z ) z t e μ z = lim z ψ ( t ) T ( ν ) ( x ; z ) 1 μ t e μ z = T ( ν ) ( x ; ψ ( t ) ) 1 μ t e μ ψ ( t ) .
From (49), we have
ψ ( t ) = e μ ψ ( t ) 1 μ t e μ ψ ( t ) = ψ ( t ) / t 1 μ t e μ ψ ( t ) .
Therefore, in conclusion, we have
n 0 T n ( ν + μ n ) ( x + μ n ) t n n ! = t ψ ( t ) ψ ( t ) T ( ν ) ( x ; ψ ( t ) ) = Ψ T ( ν ) ( x ; t )
where Ψ is the Sheffer matrix
Ψ = t ψ ( t ) ψ ( t ) , ψ ( t ) = n k ( μ n ) n k n , k 0 .
Notice also that the polynomials T n ( ν + μ n ) ( x + μ n ) form a Sheffer sequence, with spectrum
t ψ ( t ) ψ ( t ) , ψ ( t ) ( 1 t ) ν e ν t , log 1 1 t = t ψ ( t ) ψ ( t ) ( 1 ψ ( t ) ) ν e ν ψ ( t ) , log 1 1 ψ ( t ) .
Moreover, from series (50), we have the binomial identity
k = 0 n n k ( μ n ) n k T k ( ν ) ( x ) = T n ( ν + μ n ) ( x + μ n ) .
Remark 3.
Using a similar approach, we can prove that
n 0 T n ( ν ) ( x μ n ) t n n ! = t φ ( t ) φ ( t ) T ( ν ) ( x ; φ ( t ) ) = Φ T ( ν ) ( x ; t )
where φ ( t ) is the unique formal series such that φ ( t ) = t ( 1 φ ( t ) ) μ and Φ is the Sheffer matrix
Φ = t φ ( t ) φ ( t ) , φ ( t ) = ( 1 ) n k μ n n k n ! k ! n , k 0 = n k ( μ n ) n k n , k 0 .
Also, in this case the polynomials T n ( ν ) ( x μ n ) form a Sheffer sequence, with spectrum
t φ ( t ) φ ( t ) , φ ( t ) ( 1 t ) ν e ν t , log 1 1 t = t φ ( t ) φ ( t ) ( 1 φ ( t ) ) ν e ν φ ( t ) , log 1 1 φ ( t ) .

7. A Carlitz-like Identity

In 1971, Carlitz obtained [30] the following two-parameter binomial identity
( 1 ) n k = 0 n n k B m + k = ( 1 ) m k = 0 m m k B n + k
for the Bernoulli numbers B n . This identity has been generalized in various ways to many other numerical and polynomial sequences. For instance, in [31] there is a general theorem proved by the umbral calculus. Similarly, in [32] there is a generalization to the Appell polynomials using a slightly different umbral approach. Here, we will use a similar approach to find a Carlitz-like identity for the Tricomi continuants.
First, we prove the following simple, but important, identity.
Lemma 2.
The binomial transform of the Tricomi continuants is given by
k = 0 n n k μ n k T k ( ν ) ( x ) = T n ( ν + μ ) ( x + μ ) .
Proof. 
By following series (3), we have e μ t T ( ν ) ( x ; t ) = T ( ν + μ ) ( x + μ ; t ) . This is equivalent to identity (51). □
Now, we can prove the following theorem.
Theorem 10.
For every m , n N , the Tricomi continuants satisfy the Carlitz-like identity
k = 0 n n k ( 2 μ ) n k T m + k ( ν μ ) ( x μ ) = k = 0 m m k ( 2 μ ) m k T n + k ( ν + μ ) ( x + μ ) .
Proof. 
Consider the umbral map defined by the linear isomorphism φ : R [ x ] R [ x ] where φ ( x n ) = T n ( ν ) ( x ) , for all n N . Then, by identity (51) proved in Lemma 2, we have
φ ( ( x + μ ) n ) = T n ( ν + μ ) ( x + μ ) .
Since
( x μ ) m ( x + μ ) n = ( x μ ) m ( x μ + 2 μ ) n = k = 0 n n k ( 2 μ ) n k ( x μ ) m + k ( x μ ) m ( x + μ ) n = ( x + μ 2 μ ) m ( x + μ ) n = k = 0 m m k ( 2 μ ) m k ( x + μ ) n + k ,
we have the umbral identity
k = 0 n n k ( 2 μ ) n k ( x μ ) m + k = k = 0 m m k ( 2 μ ) m k ( x + μ ) n + k .
Now, by applying φ to both members of this equation, we obtain identity (52). □
Using the same approach, we can also prove the following further identity.
Theorem 11.
The Tricomi continuants satisfy the identity
k = 0 n n k ( μ 2 ) n k T 2 k ( ν ) ( x ) = k = 0 n n k ( 2 μ ) n k T n + k ( ν + μ ) ( x + μ ) .
Proof. 
Consider again the umbral map φ defined in the proof of Theorem 10. Since
( x μ ) n ( x + μ ) n = ( x 2 μ 2 ) n = k = 0 n n k ( μ 2 ) n k x 2 k ( x μ ) n ( x + μ ) n = ( x + μ 2 μ ) n ( x + μ ) n = k = 0 n n k ( 2 μ ) n k ( x + μ ) n + k ,
we have the umbral identity
k = 0 n n k ( μ 2 ) n k x 2 k = k = 0 n n k ( 2 μ ) n k ( x + μ ) n + k .
By applying the umbral map φ to both members of this equation, we obtain identity (53). □
Remark 4.
From identity (53), by the binomial inversion theorem (11), we have
T 2 n ( ν ) ( x ) = k = 0 n n k i = 0 k k i ( 2 ) k i μ 2 n k i T k + i ( ν + μ ) ( x + μ ) .
Remark 5.
For μ = 1 , identity (54) becomes
k = 0 n n k ( 1 ) n k x 2 k = k = 0 n n k ( 2 ) n k ( x + 1 ) n + k .
This identity can be used to obtain several other identities of the same kind. For instance, if we consider the umbral map φ : R [ x ] R defined by φ ( x n ) = b n , where the b n are the Bell numbers [33], p. 493, then we have φ ( ( x + 1 ) n ) = b n + 1 . Thus, by applying φ to both members of (55), we have the identity
k = 0 n n k ( 1 ) n k b 2 k = k = 0 n n k ( 2 ) n k b n + k + 1 .
Similarly, if we consider the harmonic numbers H n = k = 1 n 1 k and H n ( 2 ) = k = 1 n 1 k 2 , then we have the identities
k = 1 n n k ( 1 ) k 1 k = H n and k = 1 n n k ( 1 ) k 1 k H k = H n ( 2 ) ( n 1 ) .
Hence, by defining the umbral maps φ i : R [ x ] R by setting φ 1 ( 1 ) = 0 and φ 1 ( x n ) = ( 1 ) n 1 n , for n 1 , and φ 2 ( 1 ) = 0 and φ 2 ( x n ) = ( 1 ) n 1 n H n , for n 1 , then we have φ 1 ( ( x + 1 ) n ) = H n and φ 2 ( ( x + 1 ) n ) = H n ( 2 ) . Thus, by applying φ 1 and φ 2 to (55), we have the identities
k = 1 n n k ( 1 ) n k 1 2 k = k = 0 n n k ( 2 ) n k H n + k k = 1 n n k ( 1 ) n k 1 2 k H 2 k = k = 0 n n k ( 2 ) n k H n + k ( 2 ) .
Remark 6.
The umbral method we just used to prove the previous identities has an extremely broad scope. Starting from an umbral identity (i.e., a polynomial identity), it is possible to obtain several other identities by applying a suitable umbral map [32,34]. Consider, for instance, Simons identity [32,35]
k = 0 n n + k 2 k 2 k k x k = k = 0 n n + k 2 k 2 k k ( 1 ) n k ( x + 1 ) k .
Using once again the umbral map φ defined in the proof of theorem 10, we obtain the following Simons-like identity for the Tricomi continuants
k = 0 n n + k 2 k 2 k k T k ( ν ) ( x ) = k = 0 n n + k 2 k 2 k k ( 1 ) n k T k ( ν + 1 ) ( x + 1 ) .

8. Cayley Continuants

The Cayley continuants are defined by
U n ( ν ) ( x ) = x 1 ν x 2 ν 1 x 3 ν 2 x 4 ν n + 3 x n 1 ν n + 2 x n × n
and were considered by Cayley [36] in relation to the Sylvester continuants (see [6], Volume 2, pp. 425–426, [37])
H n ( λ ) = λ 1 n 1 λ 2 n 2 λ 3 n 3 λ 4 2 λ n 1 1 λ n × n
with the intention of proving the following surprising identity
U n ( ν ) ( x ) = k = 0 n / 2 n k n k n 2 k 1 2 k k ! p k ( ν n ) H n 2 k ( x )
where p k ( x ) = ( x + 1 ) ( x + 3 ) ( x + 2 k 1 ) .
Also, the Cayley continuants form a Sheffer (and a cross-) sequence [38,39], having exponential generating series
U ( ν ) ( x ; t ) = n 0 U n ( ν ) ( x ) t n n ! = ( 1 + t ) x + ν 2 ( 1 t ) x ν 2 .
Moreover, they can be expressed as
U n ( ν ) ( x ) = k = 0 n n k x + ν 2 k ̲ x ν 2 n k
where the polynomials x n ̲ = x ( x 1 ) ( x 2 ) ( x n + 1 ) are the falling factorials.
Cayley and Tricomi continuants are related to each other by the following formulas
U n ( ν ) ( x ) = k = 0 n n k ( 1 ) k T k ( ν / 2 ) ( x / 2 ) T n k ( ν / 2 ) ( x / 2 )
T n ( ν ) ( x ) = k = 0 n n k ( 1 ) k T k ( ν ) ( x ) U n k ( 2 ν ) ( 2 x ) .
Indeed, from series (3) and (56), we have
T ( ν / 2 ) ( x / 2 ; t ) T ( ν / 2 ) ( x / 2 ; t ) = U ( ν ) ( x ; t ) T ( ν ) ( x ; t ) U ( 2 ν ) ( 2 x ; t ) = T ( ν ) ( x ; t )
and these identities are equivalent to identities (57) and (58), respectively.
By identity (57), the Cayley continuants are expressed in terms of the Tricomi continuants. Now, to express the Tricomi continuants in terms of the Cayley continuants, consider the Sheffer matrix
( 1 t / 2 ) ν , t / 2 1 t / 2 = ν k n k n ! k ! ( 1 ) n k 2 n n , k 0 .
Then, we have
( 1 t / 2 ) ν , t / 2 1 t / 2 U ( ν ) ( x ; t ) = 1 ( 1 t ) x v 2
or, equivalently,
1 2 n k = 0 n ν k n k n ! k ! ( 1 ) n k U k ( ν ) ( x ) = x ν 2 n .
Thus, replacing x and ν by 2 x and 2 ν , we have
1 2 n k = 0 n 2 ν k n k n ! k ! ( 1 ) n k U k ( 2 ν ) ( 2 x ) = ( x ν ) n .
Therefore, by formula (6), we have
T n ( ν ) ( x ) = k = 0 n n k ν n k 2 k i = 0 k 2 ν i k i k ! i ! ( 1 ) k i U i ( 2 ν ) ( 2 x )
or, equivalently,
T n ( ν ) ( x ) = k = 0 n i = k n n i i k ( 1 ) i k 2 i ν n i ( 2 ν k ) i k ̲ U k ( 2 ν ) ( 2 x ) .

9. Hankel Matrices

In this section, we will consider the infinite Hankel matrices
H ( ν ; s ) ( x ) = T i + j + s ( ν ) ( x ) i , j 0 = T s ( ν ) ( x ) T s + 1 ( ν ) ( x ) T s + 2 ( ν ) ( x ) T s + 1 ( ν ) ( x ) T s + 2 ( ν ) ( x ) T s + 3 ( ν ) ( x ) T s + 2 ( ν ) ( x ) T s + 3 ( ν ) ( x ) T s + 4 ( ν ) ( x )
and the partial n × n Hankel matrices
H n ( ν ; s ) ( x ) = T i + j + s ( ν ) ( x ) i , j = 0 n 1 = T s ( ν ) ( x ) T s + 1 ( ν ) ( x ) T s + n 1 ( ν ) ( x ) T s + 1 ( ν ) ( x ) T s + 2 ( ν ) ( x ) T s + n ( ν ) ( x ) T s + n 1 ( ν ) ( x ) T s + n ( ν ) ( x ) T s + 2 n 2 ( ν ) ( x )
generated by the Tricomi continuants. We will prove that the matrix H ( ν ) ( x ) = H ( ν ; 0 ) ( x ) admits a Sheffer L D U -factorization, while the matrix H ( ν ; 1 ) ( x ) admits a Sheffer L T U -factorization. More precisely, an infinite matrix A has a Sheffer L D U -factorization [40] when there exist two Sheffer matrices S 1 and S 2 with main diagonal 1 and a diagonal matrix D such that A = S 1 D S 2 T . Similarly, an infinite matrix A has a Sheffer L T U -factorization [40] when there exist two Sheffer matrices S 1 and S 2 with main diagonal 1 and a tridiagonal matrix T such that A = S 1 T S 2 T .
To obtain these factorizations, we will use the exponential generating series of the infinite matrices H ( ν ) ( x ) and H ( ν ; 1 ) ( x ) . By Taylor’s formula, they are given by
h ( t , u ) = m , n 0 T m + n ( ν ) ( x ) t m m ! u n n ! = T ( ν ) ( x ; t + u ) h ( t , u ) = m , n 0 T m + n + 1 ( ν ) ( x ) t m m ! u n n ! = t T ( ν ) ( x ; t + u ) .
Moreover, we will use the following lemmas proved in [40].
Lemma 3.
Consider two Sheffer matrices
R = [ r n , k ] n , k 0 = ( g 1 ( t ) , f 1 ( t ) ) and S = [ s n , k ] n , k 0 = ( g 2 ( t ) , f 2 ( t ) ) ,
a diagonal matrix D = [ k ! h k δ n , k ] n , k 0 , and the exponential generating series h ( t ) = n 0 h n t n n ! . Then, the exponential generating series of the matrix R D S T is given by
i , j 0 k = 0 i j r i , k s j , k h k k ! t i i ! u j j ! = g 1 ( t ) g 2 ( u ) h ( f 1 ( t ) f 2 ( u ) ) .
Lemma 4.
Consider two Sheffer matrices
R = [ r n , k ] n , k 0 = ( g 1 ( t ) , f 1 ( t ) ) and S = [ s n , k ] n , k 0 = ( g 2 ( t ) , f 2 ( t ) ) ,
and a tridiagonal matrix T = [ h ! t h , k ] h , k 0 , where
t h , k = b k δ h , k + 1 + a k δ h , k + k c k δ h , k 1 .
Consider the exponential generating series a ( t ) = n 0 a n t n n ! , b ( t ) = n 0 b n t n n ! , and c ( t ) = n 0 c n t n n ! . Then, the exponential generating series of the matrix R T S T is given by
i , j 0 h , k 0 r i , k s j , k h ! t h , k t i i ! u j j ! = g 1 ( t ) g 2 ( u ) F ( t , u )
where
F ( t , u ) = a ( f 1 ( t ) f 2 ( u ) ) + f 1 ( t ) b ( f 1 ( t ) f 2 ( u ) ) + f 2 ( u ) c ( f 1 ( t ) f 2 ( u ) ) .
Now, we can obtain our first factorization.
Theorem 12.
The Hankel matrix H ( ν ) ( x ) admits the Sheffer LDU-factorization
H ( ν ) ( x ) = S ( ν ) ( x ) D ( ν ) ( x ) S ( ν ) ( x ) T
where
S ( ν ) ( x ) = e ν t ( 1 t ) x ν , t 1 t = n k T n k ( ν ) ( x + k ) n , k 0
and
D ( ν ) ( x ) = k ! ( x ν ) k δ n , k n , k 0 .
Moreover, we have the Hankel determinants
det T i + j ( ν ) ( x ) i , j = 0 n 1 = k = 0 n 1 k ! ( x ν ) k .
Proof. 
The exponential generating series of the Hankel matrix H ( ν ) ( x ) can be written as
m , n 0 T m + n ( ν ) ( x ) t m m ! u n n ! = T ( ν ) ( x ; t + u ) = e ν ( t + u ) ( 1 t u ) x ν = e ν t ( 1 t ) x ν e ν u ( 1 u ) x ν 1 1 t 1 t u 1 u x ν = g ( t ) g ( u ) h ( f ( t ) f ( u ) )
where
g ( t ) = e ν t ( 1 t ) x ν = T ( ν ) ( x ; t ) , f ( t ) = t 1 t , h ( t ) = 1 ( 1 t ) x ν .
By Lemma 3, this implies the stated factorization. Notice that such a factorization is inherited by the partial matrices, namely H n ( ν ) ( x ) = S n ( ν ) ( x ) D n ( ν ) ( x ) S n ( ν ) ( x ) T . This implies the stated determinants. □
From Theorem 12, we can obtain the following identities.
Theorem 13.
We have the identity
T m + n ( ν ) ( x ) = k = 0 m n m k n k k ! ( x ν ) k T m k ( ν ) ( x + k ) T n k ( ν ) ( x + k )
and the linearization formula
T m ( ν ) ( x ) T n ( ν ) ( x ) = i , j = 0 m , n m i n j k = 0 i j i k j k ( 1 ) k k ! ( x ν ) k ̲ T m + n i j ( ν ) ( x ) .
Proof. 
By Lemma 3 and Theorem 12, we have that identity (61) is equivalent to factorization (59). Now, we can reverse this identity by observing that in the proof of Theorem 12 we obtained the relation
T ( ν ) ( x ; t + u ) = T ( ν ) ( x ; t ) T ( ν ) ( x ; u ) 1 t 1 t u 1 u x ν
or, equivalently,
T ( ν ) ( x ; t ) T ( ν ) ( x ; u ) = 1 t 1 t u 1 u x ν T ( ν ) ( x ; t + u ) .
Since
1 t 1 t u 1 u x ν = g ( t ) g ( u ) ( 1 f ( t ) f ( u ) ) x ν
with
g ( t ) = 1 , f ( t ) = t 1 t , h ( t ) = ( 1 t ) x ν ,
we can apply Lemma 3 where R = S = ( g ( t ) , f ( t ) ) = 1 , t 1 t is the Lah matrix (12) and D = k ! ( x ν ) k ̲ δ n , k n , k 0 . This means that we have the expansion
1 t 1 t u 1 u x ν = i , j 0 k = 0 i j i k j k ( 1 ) k k ! ( x ν ) k ̲ t i i ! u j j ! .
In conclusion, by this identity and identity (63), we obtain the linearization formula (62). □
In the next theorem, we obtain our second factorization.
Theorem 14.
The Hankel matrix H ( ν ; 1 ) ( x ) admits the Sheffer LTU-factorization
H ( ν ; 1 ) ( x ) = S ( ν ) ( x ) T ( ν ) ( x ) S ( ν ) ( x ) T
where S ( ν ) ( x ) is the Sheffer matrix (60) and T ( ν ) ( x ) = h ! t h , k h , k 0 , where
t h , k = ( x ν ) k + 1 δ h , k + 1 + ( x + 2 k ) ( x ν ) k δ h , k + k ( x ν ) k δ h , k 1 .
Moreover, we have the Hankel determinants
det T i + j + 1 ( ν ) ( x ) i , j = 0 n 1 = k = 0 n 1 k ! ( x ν ) k τ n ( ν ) ( x )
where the τ n ( ν ) ( x ) are the polynomials defined by the exponential generating series
τ ( ν ) ( x ; t ) = n 0 τ n ( ν ) ( x ) t n n ! = e ν t 1 t ( 1 t ) x ν .
Proof. 
Since
n 0 T n + 1 ( ν ) ( x ) t m m ! = t T ( ν ) ( x ; t ) = x ν t ( 1 t ) x ν + 1 e ν t ,
the exponential generating series of the Hankel matrix H ( ν ; 1 ) ( x ) can be written as
m , n 0 T m + n + 1 ( ν ) ( x ) t m m ! u n n ! = t T ( ν ) ( x ; t + u ) = x ν ( t + u ) ( 1 t u ) x ν + 1 e ν ( t + u ) = e ν t ( 1 t ) x ν e ν u ( 1 u ) x ν x ν ( t + u ) ( 1 t ) ( 1 u ) 1 1 t 1 t u 1 u x ν + 1 .
Since
x ν t ν u ( 1 t ) ( 1 u ) = x + ( x ν ) t 1 t + ( x ν ) u 1 u + ( x 2 ν ) t 1 t u 1 u ,
we have
m , n 0 T m + n + 1 ( ν ) ( x ) t m m ! u n n ! = g ( t ) g ( u ) ( a ( f ( t ) f ( u ) ) + f ( t ) b ( f ( t ) f ( u ) ) + f ( u ) c ( f ( t ) f ( u ) ) )
where
g ( t ) = e ν t ( 1 t ) x ν = T ( ν ) ( x ; t ) , f ( t ) = t 1 t ,
a ( t ) = x + ( x 2 ν ) t ( 1 t ) x ν + 1 , b ( t ) = x ν ( 1 t ) x ν , c ( t ) = x ν ( 1 t ) x ν .
In particular, we have
a n = ( x + 2 n ) ( x ν ) n , b n = ( x ν ) n + 1 , c n = b n 1 = ( x ν ) n .
Therefore, by Lemma 4, we have the stated factorization. Again, such a factorization is inherited by the partial matrices, namely H n ( ν ; 1 ) ( x ) = S n ( ν ) ( x ) T n ( ν ) ( x ) S n ( ν ) ( x ) T . Then, we have
det H n ( ν ; 1 ) ( x ) = det T n ( ν ) ( x )
Notice that T ( ν ) ( x ) = h ! ( x ν ) k t h , k h , k 0 , where
t h , k = ( x ν + k ) δ h , k + 1 + ( x + 2 k ) δ h , k + k δ h , k 1 .
Then, we have
det T n ( ν ) ( x ) = k = 0 n 1 k ! ( x ν ) k τ n ( ν ) ( x )
where τ n ( ν ) ( x ) = det t h , k h , k = 0 n 1 , that is
τ n ( ν ) ( x ) = x 1 x ν x + 2 2 x ν + 1 x + 4 3 x ν + 2 x + 6 4 x ν + n 3 x + 2 ( n 2 ) n 1 x ν + n 2 x + 2 ( n 1 ) n × n .
Therefore, the polynomials τ n ( ν ) ( x ) satisfy the recurrence
τ n + 2 ( ν ) ( x ) = ( x + 2 n + 2 ) τ n + 1 ( ν ) ( x ) ( n + 1 ) ( x ν + n ) τ n ( ν ) ( x )
with the initial values τ 0 ( ν ) ( x ) = 1 and τ 1 ( ν ) ( x ) = x . Now, by the usual techniques of the formal series, it is straightforward to obtain the generating series (64). This concludes the proof. □
Remark 7.
The polynomials τ n ( ν ) ( x ) are themselves continuants, and by series (64), they also form a Sheffer (and a cross-) sequence with spectrum
τ ( ν ) = ( 1 t ) ν e ν t 1 t , log 1 1 t .
Also, these polynomials can be expressed in terms of the Laguerre polynomials. Indeed, from series (3) and (4), we have
τ n ( ν ) ( x ) = L n ( x ν 1 ) ( ν ) .
For this reason, we call these polynomials Tricomi continuants of the second kind. In Section 10, we will give some representations of these continuants.
Theorems 12 and 14 can be generalized as follows.
Theorem 15.
The Hankel matrix
H ( ν ) ( λ ; x ) = λ T i + j ( ν ) ( x ) + T i + j + 1 ( ν ) ( x ) i , j 0
admits the Sheffer LTU-factorization
H ( ν ) ( λ ; x ) = S ( ν ) ( x ) T ( ν + λ ) ( x + λ ) S ( ν ) ( x ) T
where S ( ν ) ( x ) is the Sheffer matrix (60) and T ( ν ) ( x ) is the tridiagonal matrix defined in Theorem 14. Moreover, we have the Hankel determinants
det λ T i + j ( ν ) ( x ) + T i + j + 1 ( ν ) ( x ) i , j = 0 n 1 = k = 0 n 1 k ! ( x ν ) k τ n ( ν + λ ) ( x + λ ) .
Proof. 
By Theorems 12 and 14, we have
H ( ν ) ( λ ; x ) = λ H ( ν ) ( x ) + H ( ν ; 1 ) ( λ ; x ) = S ( ν ) ( x ) ( λ D ( ν ) ( x ) + T ( ν ) ( x ) ) S ( ν ) ( x ) T .
Now, it is straightforward to prove that
λ D ( ν ) ( x ) + T ( ν ) ( x ) = T ( ν + λ ) ( x + λ ) .
This implies the stated factorization. Then, by Theorem 14, we have the stated determinant. □
By Theorems 12 and 14, we can also compute the following Hankel determinants.
Theorem 16.
The Hankel determinants of order 2 are given by
det T i + j + 2 ( ν ) ( x ) i , j = 0 n 1 = k = 0 n k ! ( x ν ) k k = 0 n τ k ( ν ) ( x ) 2 k ! ( x ν ) k .
Proof. 
Let h n = det T i + j ( ν ) ( x ) i , j = 0 n 1 , h n = det T i + j + 1 ( ν ) ( x ) i , j = 0 n 1 and h n = det T i + j + 2 ( ν ) ( x ) i , j = 0 n 1 . Then, by Dodgson’s formula [41] (or Jacobi identity [42], p. 303), we have the following linear recurrence of the first order
h n + 1 h n + 1 = h n + 2 h n + h n + 1 2
with the initial value h 0 = 1 . By Theorems 12 and 14, we have h n = h n τ n ( ν ) ( x ) and
h n + 1 = ( n + 1 ) ( x ν ) n + 1 h n + h n + 1 τ n + 1 ( ν ) ( x ) 2 .
Now, it is straightforward to show that the solution of this recurrence is given by the stated formula. □

10. Representations

In this final section, we will find some identities for the Tricomi continuants T n ( ν ) ( x ) and τ n ( ν ) ( x ) involving the generalized Stirling numbers and, in particular, we will show that such continuants can be expressed in terms of each other.
Consider the generalized Stirling numbers defined by the Sheffer matrices (9) and the exponential polynomials S n ( x ) defined by the exponential generating series
n 0 S n ( x ) t n n ! = e x ( e t 1 ) .
Since
( e μ t , 1 e t ) T ( ν ) ( x ; t ) = e ( x ν μ ) t e ν ( e t 1 )
we have the identity
k = 0 n ( 1 ) n k S n , k ( μ ) T k ( ν ) ( x ) = k = 0 n n k ( 1 ) n k S n k ( ν ) ( x ν μ ) k .
Then, by the Stirling inversion theorem (10), we have the representation
T n ( ν ) ( x ) = k = 0 n s n , k ( μ ) i = 0 k k i ( 1 ) k i S k i ( ν ) ( x ν μ ) i .
In particular, for μ = 0 , 1 , we have the ordinary Stirling numbers of the first kind [33], namely s n , k ( 0 ) = n k and s n , k ( 1 ) = n + 1 k + 1 . Therefore,
T n ( ν ) ( x ) = k = 0 n n k i = 0 k k i ( 1 ) k i S k i ( ν ) ( x ν ) i T n ( ν ) ( x ) = k = 0 n n + 1 k + 1 i = 0 k k i ( 1 ) k i S k i ( ν ) ( x ν 1 ) i .
Similarly, we have the identity
( e μ t , 1 e t ) τ ( ν ) ( x ; t ) = e ( x ν μ ) t e ν ( e t 1 ) ,
and consequently
k = 0 n ( 1 ) n k S n , k ( μ ) τ k ( ν ) ( x ) = k = 0 n n k S n k ( ν ) ( x ν μ ) k .
Again, by the Stirling inversion theorem (10), we have the representation
τ n ( ν ) ( x ) = k = 0 n s n , k ( μ ) i = 0 k k i S k i ( ν ) ( x ν μ ) i
and, in particular,
τ n ( ν ) ( x ) = k = 0 n n k i = 0 k k i S k i ( ν ) ( x ν ) i τ n ( ν ) ( x ) = k = 0 n n + 1 k + 1 i = 0 k k i S k i ( ν ) ( x ν 1 ) i .
Consider now the Lah matrix (12). Since
1 , t 1 + t T ( ν ) ( x ; t ) = τ ( ν ) ( x ; t ) ,
we have the relation
k = 0 n n k ( 1 ) n k T k ( ν ) ( x ) = ( 1 ) n τ n ( ν ) ( x ) ,
or
τ n ( ν ) ( x ) = k = 0 n n k ( 1 ) k T k ( ν ) ( x ) .
Finally, by the Lah inversion theorem (13), we also have the inverse representation
T n ( ν ) ( x ) = k = 0 n n k ( 1 ) k τ k ( ν ) ( x ) .
These last relations are equivalent to the following matrix identities
L ¯ T ( ν ) = τ ( ν ) ¯ , τ ( ν ) = L T ( ν ) ¯ and T ( ν ) = L τ ( ν ) ¯
where T ( ν ) and τ ( ν ) are the Sheffer matrices (7) and (65).

Funding

This research received no external funding.

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Conflicts of Interest

The author declares no conflicts of interest.

References

  1. Tricomi, F.G. A class of non-orthogonal polynomials related to those of Laguerre. Anal. Math. 1951, 1, 209–231. [Google Scholar] [CrossRef]
  2. Agrawal, H.C. A note on generalized Tricomi polynomials. Publ. Inst. Math. 1975, 19, 5–8. [Google Scholar]
  3. Carlitz, L. On some polynomials of Tricomi. Boll. Un. Mat. Ital. 1958, 13, 58–64. [Google Scholar]
  4. Chihara, T.S. An Introduction to Orthogonal Polynomials; Gordon and Breach: New York, NY, USA, 1978. [Google Scholar]
  5. Munarini, E. Combinatorial identities for the Tricomi polynomials. J. Integer Seq. 2020, 23, 3. [Google Scholar]
  6. Muir, T. The Theory of Determinants in the Historical Order of Developement; Dover: New York, NY, USA, 1960. [Google Scholar]
  7. Vein, R.; Dale, P. Determinants and Their Applications in Mathematical Physics; Springer: New York, NY, USA, 1999. [Google Scholar]
  8. Roman, S. The Umbral Calculus; Academic Press: New York, NY, USA, 1984. [Google Scholar]
  9. Erdélyi, A.; Magnus, W.; Oberhettinger, F.; Tricomi, F. (Eds.) Higher Trascendental Functions; The Bateman Manuscript Project, Volumes I–III; McGraw-Hill: New York, NY, USA, 1953. [Google Scholar]
  10. Boas, R.P., Jr.; Buck, R.C. Polynomial Expansions of Analytic Functions; Academic Press: New York, NY, USA, 1964. [Google Scholar]
  11. Rainville, E.D. Special Functions; Macmillan: New York, NY, USA, 1960. [Google Scholar]
  12. Roman, S.M.; Rota, G.-C. The umbral calculus. Adv. Math. 1978, 27, 95–188. [Google Scholar] [CrossRef]
  13. Rota, G.-C. Finite Operator Calculus; Academic Press: New York, NY, USA, 1975. [Google Scholar]
  14. Rota, G.-C.; Kahaner, D.; Odlyzko, A. On the foundations of combinatorial theory. VIII: Finite operator calculus. Math. Anal. Appl. 1973, 42, 684–760. [Google Scholar] [CrossRef]
  15. Rota, G.-C.; Mullin, R. On the foundations of combinatorial theory, III. Theory of Binomial Enumeration. In Graph Theory and Its Applications; Academic Press: New York, NY, USA, 1970. [Google Scholar]
  16. Steffensen, J.F. The poweroid, an extension of the mathematical notion of power. Acta Math. 1941, 73, 333–366. [Google Scholar] [CrossRef]
  17. Costabile, F.A.; Gualtieri, M.I.; Napoli, A. Towards the centenary of Sheffer polynomial sequences: Old and recent results. Mathematics 2022, 10, 4435. [Google Scholar] [CrossRef]
  18. Sheffer, I.M. Some properties of polynomial sets of type zero. Duke Math. J. 1939, 5, 590–622. [Google Scholar] [CrossRef]
  19. Appell, P. Sur une classe de polynômes. Ann. Sci. École Norm. 1880, 9, 119–144. [Google Scholar] [CrossRef]
  20. Shapiro, L.W.; Getu, S.; Woan, W.-J.; Woodson, L.C. The Riordan group. Discret. Appl. Math. 1991, 34, 229–239. [Google Scholar] [CrossRef]
  21. Shapiro, L.; Sprugnoli, R.; Barry, P.; Cheon, G.-S.; He, T.-X.; Merlini, D.; Wang, W. The Riordan Group and Applications; Springer: Cham, Switzerland, 2022. [Google Scholar]
  22. Carlitz, L. Weighted Stirling Numbers of the First and Second Kind I. Fibonacci Quart. 1980, 18, 147–162. [Google Scholar]
  23. Carlitz, L. Weighted Stirling Numbers of the First and Second Kind II. Fibonacci Quart. 1980, 18, 242–257. [Google Scholar]
  24. Pincherle, S.; Amaldi, U. Le Operazioni Distributive e le loro Applicazioni all’Analisi; Zanichelli: Bologna, Italy, 1901. [Google Scholar]
  25. Szego, G. On an inequality of P. Turán concerning Legendre polynomials. Bull. Am. Math. Soc. 1948, 54, 401–405. [Google Scholar] [CrossRef]
  26. Turán, P. On the zeros of the polynomials of Legendre. Časopis Pěst. Mat. Fys. 1950, 75, 113–122. [Google Scholar]
  27. Comtet, L. Advanced Combinatorics; Reidel: Dordrecht, The Netherlands; Boston, MA, USA, 1974. [Google Scholar]
  28. Hautus, M.L.J.; Klarner, D.A. The diagonal of a double power series. Duke Math. J. 1971, 38, 229–235. [Google Scholar] [CrossRef]
  29. Stanley, R.P. Enumerative Combinatorics; Cambridge University Press: Cambridge, UK, 1999; Volume 2. [Google Scholar]
  30. Carlitz, L. Problem 795. Math. Mag. 1971, 44, 107. [Google Scholar]
  31. Gessel, I.M. Applications of the classical umbral calculus. Algebra Universalis 2003, 49, 397–434. [Google Scholar] [CrossRef]
  32. Munarini, E. Combinatorial identities for Appell polynomials. Appl. Anal. Discret. Math. 2018, 12, 362–388. [Google Scholar] [CrossRef]
  33. Graham, R.L.; Knuth, D.E.; Patashnik, O. Concrete Mathematics; Addison-Wesley: Reading, UK, 1989. [Google Scholar]
  34. Rota, G.-C. The number of partitions of a set. Am. Math. Mon. 1964, 71, 498–504. [Google Scholar] [CrossRef]
  35. Simons, S. A curious identity. Math. Gaz. 2001, 85, 296–298. [Google Scholar] [CrossRef]
  36. Cayley, A. On the determination of the value of a certain determinant. Quart. J. Math. 1858, 2, 163–166. [Google Scholar]
  37. Sylvester, J.J. Théorème sur les déterminants de M. Sylvester. Nouv. Ann. Math. 1854, 13, 305. [Google Scholar]
  38. Munarini, E.; Torri, D. Cayley continuants. Theoret. Comput. Sci. 2005, 347, 353–369. [Google Scholar] [CrossRef]
  39. Munarini, E. Umbral operators for Cayley and Sylvester continuants. Appl. Anal. Discret. Math. 2022, 16, 307–327. [Google Scholar] [CrossRef]
  40. Ferrari, M.M.; Munarini, E. Decomposition of some Hankel matrices generated by the generalized rencontres polynomials. Linear Algebra Appl. 2019, 567, 180–201. [Google Scholar] [CrossRef]
  41. Dodgson, C.L. Condensation of determinants. Proc. R. Soc. 1866, 15, 150–155. [Google Scholar]
  42. Aigner, M. A Course in Enumeration; Springer: Berlin/Heidelberg, Germany, 2007. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Munarini, E. Tricomi Continuants. Mathematics 2024, 12, 401. https://doi.org/10.3390/math12030401

AMA Style

Munarini E. Tricomi Continuants. Mathematics. 2024; 12(3):401. https://doi.org/10.3390/math12030401

Chicago/Turabian Style

Munarini, Emanuele. 2024. "Tricomi Continuants" Mathematics 12, no. 3: 401. https://doi.org/10.3390/math12030401

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop