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.
Keywords:
exponential Riordan matrices; Sheffer polynomials; umbral operators; congruences; binomial identities; Cayley continuants; Hankel matrices; Sheffer factorizations MSC:
05A19; 05A15; 05A40; 15A23; 15A15; 11B83
1. Introduction
In 1951, Tricomi [1] considered a sequence of non-orthogonal polynomials related to the generalized Laguerre polynomials. These polynomials satisfy the three-term recurrence
with the initial values and and have ordinary generating series
They have degree (for a generic parameter ) and can be expressed as
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 determinants
For the first values of n, we have
These determinants are monic polynomials of degree n (for any parameter ) and satisfy the recurrence
with the initial values and . From this recurrence, it is straightforward to obtain the exponential generating series
By comparing series (1) and (3), we have . 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
and by formula (19) in [9], Volume II, p. 189,
Then, from series (3) and (5), we have
or, more explicitly,
where 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
For , these matrices have integer entries (as can be easily deduced from formula (6)). For instance, for , we have the (north-west partial) matrices
Moreover, if , we have and then 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 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 having exponential generating series
where and are two exponential series with , , and . In this case, the Sheffer sequence has spectrum .
An Appell sequence [19] is a Sheffer sequence with spectrum . A Steffensen sequence [16] is a Sheffer sequence , depending on a parameter , with spectrum , where is an exponential series with . Each Steffensen sequence is a cross-sequence [13,14], since it satisfies the binomial identity
A Sheffer matrix is an infinite lower triangular matrix such that
for two exponential series and , with , and . The entries of the matrix S satisfy the recurrence
where the are the coefficients of the series , where is the compositional inverse of .
Clearly, the row polynomials of the Sheffer matrix form the Sheffer sequence with spectrum , 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 and is given by
the identity matrix is and the inverse of a Sheffer matrix is the Sheffer matrix
Given a Sheffer matrix and its inverse , we have the inversion theorem: given any two sequences and , we have
Consider, for instance, the generalized Stirling numbers of the first kind and the generalized Stirling numbers of the second kind , defined as the entries of the following Sheffer matrices [22,23]
These matrices are related to each other by the following identities
Hence, we have the Stirling inversion theorem
or
Given a Sheffer matrix , we have
or , where . A Sheffer matrix S is a pseudo-involution when , or, equivalently, when is an involution. For these matrices, we have the following inversion theorem: given any two sequences and , we have
For instance, the binomial matrix
is a pseudo-involution. In this case, we have the binomial inversion theorem
Also the Lah matrix
whose entries are the (signless) Lah numbers, is a pseudo-involution. In this case, we have the Lah inversion theorem
Given a Sheffer matrix , the Sheffer transform of an exponential series is the exponential series given by
By Pincherle’s theorem [24], every linear operator 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 , where for every , such that
for every polynomial of degree n.
Given a polynomial sequence , where each has degree n, we can consider the linear operators defined, for every , by
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 .
The umbral operators J, M, N, and A of a Sheffer sequence with spectrum are given by [8]
Some other important operators are the shift operator defined by and represented by , the forward difference operator , and the backward difference operator . Moreover, we have
where the coefficients 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
or, equivalently, by
Moreover, the operators J, M, and N satisfy the relation
Proof.
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
Proof.
Remark 1.
Since , we have
where . Hence, we have the identity
which generalizes identity (30). In particular, for (and replacing the index i by k), we have
Recall that the Bernoulli numbers and the harmonic numbers have generating series
Then, we have the following further identities.
Theorem 3.
The Tricomi continuants satisfy the relations
where the coefficients are the Bernoulli numbers and the coefficients are the harmonic numbers.
Proof.
Identity (36) derives from (19) and (35). Then, from (24), we have and from this representation we have
Then, by (20) and (35), we have relation (37). Similarly, from representation (28), we have relation (38). To obtain the fourth relation, notice that
Hence
This representation and (35) imply relation (39). Finally, by (34), relation (39) reduces to (40). □
Remark 2.
Consider the coefficients of the Sheffer matrix (7). Since
and
where , then we have
where the coefficients are the Stirling numbers of the first kind. Moreover, since
we have the recurrence
Furthermore, since , recurrence (8) becomes
Finally, notice that from recurrence (42) we have
with and . Thus, if , then for every . Consequently, by formula (41), we have for every . In conclusion, if with , then the matrix 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 of real polynomials satisfies the Turán inequalities when for all x belonging to a suitable interval of . 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
Proof.
We can now proof the following inequalities.
Theorem 5.
If and , then
5. Congruences
In this section, we will obtain some congruences for the polynomials and , which by formula (6) are polynomials with integer coefficients (considering as an arbitrary parameter). First, recall that, given two polynomials , we have when the corresponding coefficients of and are congruent modulo p.
First of all, we have the following simple result.
Lemma 1.
Let p be a prime. Then .
Proof.
If p is prime, by formula (6), we have (working in )
Since , we have . This implies our congruence. □
More generally, we have the following theorem.
Theorem 6.
Let p be a prime. Then, for every , we have the congruence
Proof.
Theorem 6 can be generalized as follows.
Theorem 7.
Let p be a prime. Then, for every , , we have the congruences
Proof.
Furthermore, we also have the following congruences.
Theorem 8.
Let p be a prime. Then, for every , we have the congruence
Proof.
Finally, Theorem 8 can be easily extended in the following way.
Theorem 9.
Let p be a prime. Then, for every , , we have the congruences
6. A Binomial Identity
Consider the polynomials , where is an arbitrary parameter. To obtain their exponential generating series , consider the bivariate generating series
Since 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
There is only one pole (of the first order) tending to 0 as , given by the unique (invertible) formal series , such that
Hence, by the residue theorem, we have
From (49), we have
Therefore, in conclusion, we have
where is the Sheffer matrix
Notice also that the polynomials form a Sheffer sequence, with spectrum
Moreover, from series (50), we have the binomial identity
Remark 3.
Using a similar approach, we can prove that
where is the unique formal series such that and Φ is the Sheffer matrix
Also, in this case the polynomials form a Sheffer sequence, with spectrum
7. A Carlitz-like Identity
In 1971, Carlitz obtained [30] the following two-parameter binomial identity
for the Bernoulli numbers . 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
Now, we can prove the following theorem.
Theorem 10.
For every , the Tricomi continuants satisfy the Carlitz-like identity
Proof.
Using the same approach, we can also prove the following further identity.
Theorem 11.
The Tricomi continuants satisfy the identity
Proof.
Consider again the umbral map defined in the proof of Theorem 10. Since
we have the umbral identity
By applying the umbral map to both members of this equation, we obtain identity (53). □
Remark 5.
For , identity (54) becomes
This identity can be used to obtain several other identities of the same kind. For instance, if we consider the umbral map defined by , where the are the Bell numbers [33], p. 493, then we have . Thus, by applying φ to both members of (55), we have the identity
Similarly, if we consider the harmonic numbers and , then we have the identities
Hence, by defining the umbral maps by setting and , for , and and , for , then we have and . Thus, by applying and to (55), we have the identities
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]
Using once again the umbral map φ defined in the proof of theorem 10, we obtain the following Simons-like identity for the Tricomi continuants
8. Cayley Continuants
The Cayley continuants are defined by
and were considered by Cayley [36] in relation to the Sylvester continuants (see [6], Volume 2, pp. 425–426, [37])
with the intention of proving the following surprising identity
where .
Also, the Cayley continuants form a Sheffer (and a cross-) sequence [38,39], having exponential generating series
Moreover, they can be expressed as
where the polynomials are the falling factorials.
Cayley and Tricomi continuants are related to each other by the following formulas
Indeed, from series (3) and (56), we have
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
Then, we have
or, equivalently,
Thus, replacing x and by and , we have
Therefore, by formula (6), we have
or, equivalently,
9. Hankel Matrices
In this section, we will consider the infinite Hankel matrices
and the partial Hankel matrices
generated by the Tricomi continuants. We will prove that the matrix admits a Sheffer -factorization, while the matrix admits a Sheffer -factorization. More precisely, an infinite matrix A has a Sheffer -factorization [40] when there exist two Sheffer matrices and with main diagonal 1 and a diagonal matrix D such that . Similarly, an infinite matrix A has a Sheffer -factorization [40] when there exist two Sheffer matrices and with main diagonal 1 and a tridiagonal matrix T such that .
To obtain these factorizations, we will use the exponential generating series of the infinite matrices and . By Taylor’s formula, they are given by
Moreover, we will use the following lemmas proved in [40].
Lemma 3.
Consider two Sheffer matrices
a diagonal matrix , and the exponential generating series . Then, the exponential generating series of the matrix is given by
Lemma 4.
Consider two Sheffer matrices
and a tridiagonal matrix , where
Consider the exponential generating series , , and . Then, the exponential generating series of the matrix is given by
where
Now, we can obtain our first factorization.
Theorem 12.
The Hankel matrix admits the Sheffer LDU-factorization
where
and
Moreover, we have the Hankel determinants
Proof.
The exponential generating series of the Hankel matrix can be written as
where
By Lemma 3, this implies the stated factorization. Notice that such a factorization is inherited by the partial matrices, namely . This implies the stated determinants. □
From Theorem 12, we can obtain the following identities.
Theorem 13.
We have the identity
and the linearization formula
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
or, equivalently,
Since
with
we can apply Lemma 3 where is the Lah matrix (12) and . This means that we have the expansion
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 admits the Sheffer LTU-factorization
where is the Sheffer matrix (60) and , where
Moreover, we have the Hankel determinants
where the are the polynomials defined by the exponential generating series
Proof.
Since
the exponential generating series of the Hankel matrix can be written as
Since
we have
where
In particular, we have
Therefore, by Lemma 4, we have the stated factorization. Again, such a factorization is inherited by the partial matrices, namely . Then, we have
Notice that , where
Then, we have
where , that is
Therefore, the polynomials satisfy the recurrence
with the initial values and . 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 are themselves continuants, and by series (64), they also form a Sheffer (and a cross-) sequence with spectrum
Also, these polynomials can be expressed in terms of the Laguerre polynomials. Indeed, from series (3) and (4), we have
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
admits the Sheffer LTU-factorization
where is the Sheffer matrix (60) and is the tridiagonal matrix defined in Theorem 14. Moreover, we have the Hankel determinants
Proof.
By Theorems 12 and 14, we have
Now, it is straightforward to prove that
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
Proof.
Let , and . Then, by Dodgson’s formula [41] (or Jacobi identity [42], p. 303), we have the following linear recurrence of the first order
with the initial value . By Theorems 12 and 14, we have and
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 and 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 defined by the exponential generating series
Since
we have the identity
Then, by the Stirling inversion theorem (10), we have the representation
In particular, for , we have the ordinary Stirling numbers of the first kind [33], namely and . Therefore,
Similarly, we have the identity
and consequently
Again, by the Stirling inversion theorem (10), we have the representation
and, in particular,
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
- Tricomi, F.G. A class of non-orthogonal polynomials related to those of Laguerre. Anal. Math. 1951, 1, 209–231. [Google Scholar] [CrossRef]
- Agrawal, H.C. A note on generalized Tricomi polynomials. Publ. Inst. Math. 1975, 19, 5–8. [Google Scholar]
- Carlitz, L. On some polynomials of Tricomi. Boll. Un. Mat. Ital. 1958, 13, 58–64. [Google Scholar]
- Chihara, T.S. An Introduction to Orthogonal Polynomials; Gordon and Breach: New York, NY, USA, 1978. [Google Scholar]
- Munarini, E. Combinatorial identities for the Tricomi polynomials. J. Integer Seq. 2020, 23, 3. [Google Scholar]
- Muir, T. The Theory of Determinants in the Historical Order of Developement; Dover: New York, NY, USA, 1960. [Google Scholar]
- Vein, R.; Dale, P. Determinants and Their Applications in Mathematical Physics; Springer: New York, NY, USA, 1999. [Google Scholar]
- Roman, S. The Umbral Calculus; Academic Press: New York, NY, USA, 1984. [Google Scholar]
- 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]
- Boas, R.P., Jr.; Buck, R.C. Polynomial Expansions of Analytic Functions; Academic Press: New York, NY, USA, 1964. [Google Scholar]
- Rainville, E.D. Special Functions; Macmillan: New York, NY, USA, 1960. [Google Scholar]
- Roman, S.M.; Rota, G.-C. The umbral calculus. Adv. Math. 1978, 27, 95–188. [Google Scholar] [CrossRef]
- Rota, G.-C. Finite Operator Calculus; Academic Press: New York, NY, USA, 1975. [Google Scholar]
- 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]
- 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]
- Steffensen, J.F. The poweroid, an extension of the mathematical notion of power. Acta Math. 1941, 73, 333–366. [Google Scholar] [CrossRef]
- 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]
- Sheffer, I.M. Some properties of polynomial sets of type zero. Duke Math. J. 1939, 5, 590–622. [Google Scholar] [CrossRef]
- Appell, P. Sur une classe de polynômes. Ann. Sci. École Norm. 1880, 9, 119–144. [Google Scholar] [CrossRef]
- Shapiro, L.W.; Getu, S.; Woan, W.-J.; Woodson, L.C. The Riordan group. Discret. Appl. Math. 1991, 34, 229–239. [Google Scholar] [CrossRef]
- 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]
- Carlitz, L. Weighted Stirling Numbers of the First and Second Kind I. Fibonacci Quart. 1980, 18, 147–162. [Google Scholar]
- Carlitz, L. Weighted Stirling Numbers of the First and Second Kind II. Fibonacci Quart. 1980, 18, 242–257. [Google Scholar]
- Pincherle, S.; Amaldi, U. Le Operazioni Distributive e le loro Applicazioni all’Analisi; Zanichelli: Bologna, Italy, 1901. [Google Scholar]
- Szego, G. On an inequality of P. Turán concerning Legendre polynomials. Bull. Am. Math. Soc. 1948, 54, 401–405. [Google Scholar] [CrossRef]
- Turán, P. On the zeros of the polynomials of Legendre. Časopis Pěst. Mat. Fys. 1950, 75, 113–122. [Google Scholar]
- Comtet, L. Advanced Combinatorics; Reidel: Dordrecht, The Netherlands; Boston, MA, USA, 1974. [Google Scholar]
- Hautus, M.L.J.; Klarner, D.A. The diagonal of a double power series. Duke Math. J. 1971, 38, 229–235. [Google Scholar] [CrossRef]
- Stanley, R.P. Enumerative Combinatorics; Cambridge University Press: Cambridge, UK, 1999; Volume 2. [Google Scholar]
- Carlitz, L. Problem 795. Math. Mag. 1971, 44, 107. [Google Scholar]
- Gessel, I.M. Applications of the classical umbral calculus. Algebra Universalis 2003, 49, 397–434. [Google Scholar] [CrossRef][Green Version]
- Munarini, E. Combinatorial identities for Appell polynomials. Appl. Anal. Discret. Math. 2018, 12, 362–388. [Google Scholar] [CrossRef]
- Graham, R.L.; Knuth, D.E.; Patashnik, O. Concrete Mathematics; Addison-Wesley: Reading, UK, 1989. [Google Scholar]
- Rota, G.-C. The number of partitions of a set. Am. Math. Mon. 1964, 71, 498–504. [Google Scholar] [CrossRef]
- Simons, S. A curious identity. Math. Gaz. 2001, 85, 296–298. [Google Scholar] [CrossRef]
- Cayley, A. On the determination of the value of a certain determinant. Quart. J. Math. 1858, 2, 163–166. [Google Scholar]
- Sylvester, J.J. Théorème sur les déterminants de M. Sylvester. Nouv. Ann. Math. 1854, 13, 305. [Google Scholar]
- Munarini, E.; Torri, D. Cayley continuants. Theoret. Comput. Sci. 2005, 347, 353–369. [Google Scholar] [CrossRef]
- Munarini, E. Umbral operators for Cayley and Sylvester continuants. Appl. Anal. Discret. Math. 2022, 16, 307–327. [Google Scholar] [CrossRef]
- 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]
- Dodgson, C.L. Condensation of determinants. Proc. R. Soc. 1866, 15, 150–155. [Google Scholar]
- 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. |
© 2024 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).