1. Introduction
Combinatorial constants are widely used in many disciplines such as probabilistic calculations, theoretical physics problem solving, computer algorithm analysis, etc. Cauchy numbers are special sequences that are widely used in number theory, numerical analysis, etc. In recent years, many papers in [1] [2] [3] [4] have been devoted to the study of Cauchy numbers and polynomials identities by various methods. High-order Cauchy numbers and polynomials are introduced by Taekyun Kim, Dae San Kim, Hyuck In Kwon and Jongjin Seo in [1]. Higher-order Cauchy of the first kind and poly-Cauchy of the first kind mixed type polynomials are introduced by D. S. Kim, T in [2]. About Cauchy numbers and polynomials and other polynomials, more combinatorial identities are derived. In this paper, we establish some new identities and properties by using High-order Cauchy polynomials.
The High-Order Cauchy polynomials of the first kind and the second are defined by the following generating function in [1] [2].
The High-Order Cauchy polynomials of the first kind are defined by the following generating function
(1)
When
,
,
are called the Cauchy numbers.
The High-Order Cauchy polynomials of the second kind are given by the generating function
(2)
When
,
,
are called the Cauchy numbers of second kind.
The generating functions of the relevant special combinatorial sequences involved in this paper are as follows [3] - [17]:
The α-Cauchy numbers of the first kind are given by the generating function to be
(3)
The α-Cauchy numbers of the second kind are given by the generating function to be
(4)
For
, the high-order generalized Cauchy numbers are given by the generating function to be
(5)
The High-order Daehee polynomials of the second kind are given by the generating function to be
(6)
When
,
,
are called the Daehee numbers of second kind.
For
, the α-Daehee polynomials of the first kind are given by the generating function to be
(7)
The generalized Bell polynomials of the first kind are given by the generating function
(8)
The generalized Bell polynomials of the second kind are given by the generating function
(9)
The generalized Bernoulli polynomials are given by the generating function to be
(10)
When
,
are called Bernoulli polynomials.
For
, the high-order degenerate Bernoulli numbers of the second are given by the generating function
(11)
The high-order Changhee polynomials are defined by
(12)
When
,
are called the Changhee-Genocchi numbers. When
, we get the following generating function
(13)
The negative order Changhee polynomials are defined by
(14)
The high-order Changhee-Genocchi polynomials are defined by
(15)
When
,
are called the high-order Changhee-Genocchi numbers.
The Lah numbers are given by the generating function
(16)
The generalized Lah numbers are given by the generating function
(17)
When
,
.
The classical Harmonic numbers are given by the generating function
(18)
The generalized Harmonic numbers are given by the generating function
(19)
The Stirling numbers of the first kind and the second kind are defined by
(20)
(21)
The generalized Stirling numbers of the first kind and the second kind are defined by
(22)
(23)
For integer
, the combinatorial numbers are defined by
(24)
then Equation is equivalent to
(25)
Lemma 1 (Inversion Formula) [15] Let
be functions defined on the set of positive integers, then
(26)
(27)
A Riordan array is a pair
of formal power series with
. It defines an infinite lower triangular array
according to the rule:
(28)
Hence we write
.
Lemma 2 [16] [17] If
is a Riordan array and
is the generating function of the sequence
, i.e.,
or
. Then we have
(29)
2. Properties about Cauchy Polynomials
In this section, we establish some identities and give some properties of high-order Cauchy polynomials by using generating functions.
Theorem 2.1. For nonnegative integer n, we obtain
(30)
Proof By (1), we get
Comparing the coefficients of
in both sides, we get the identities.
Corollary 2.1. For
in (30), we obtain
(31)
Corollary 2.2. For
in (30), we obtain
(32)
Corollary 2.3. For
in (32), we obtain
(33)
For
in (33), we obtain
(34)
For
in (33), we obtain
(35)
Similarly, we can obtain
Theorem 2.2. For nonnegative integer n, we obtain
(36)
Theorem 2.3. For integer
, we have
(37)
Proof From generating function (1), we have
Comparing the coefficients of
in both sides, we can easily get the identities.
Similarly, we can obtain
Theorem 2.4. For integer
, we have
(38)
Theorem 2.5. For nonnegative integer n, we obtain
(39)
Proof From generating function (1), (6), we get
Comparing the coefficients of
in both sides, we can easily get the identities.
Corollary 2.4. For nonnegative integer n,
in (30), we have
(40)
Similarly, we can obtain
Theorem 2.6. For nonnegative integer n, we have
(41)
Corollary 2.5. For nonnegative integer n,
in (41), we have
(42)
Theorem 2.7. For nonnegative integer n,
, we have
(43)
Proof From generating function (1), (7), we get
Comparing the coefficients of
in both sides, we can easily get the identities.
Corollary 2.6. For nonnegative integer n,
in (43), we have
(44)
Theorem 2.8. For nonnegative integer n, we have
(45)
Proof From generating function (1), (5), we get
Comparing the coefficients of
in both sides, we can easily get the identities.
The proof of the Theorem 2.9 is similar to the proof of the Theorem 2.8, we can obtain
Theorem 2.9. For nonnegative integer n, we have
(46)
Corollary 2.7. For nonnegative integer n,
in (45), (46), we have
(47)
(48)
Theorem 2.10. For nonnegative integer n, we have
(49)
Proof From generating function (1), (22), we get
Comparing the coefficients of
in both sides, we can easily get the identities.
By means of Lemma 1, the inverse relation (27). This leads to the following conclusion,
Theorem 2.11. For nonnegative integer n, we have
(50)
Similarly, we can obtain
Theorem 2.12. For nonnegative integer n, we have
(51)
(52)
Theorem 2.13. For integer
, we have
(53)
Proof From generating function (1), (18), we get
Comparing the coefficients of
in both sides, we can easily get the identities.
Theorem 2.14. For nonnegative integer n, we have
(54)
Proof From generating function (1), (19), we get
Comparing the coefficients of
in both sides, we can easily get the identities.
Theorem 2.15. For integer
,
, we have
(55)
Proof From generating function (1), (7), (17), we get
Comparing the coefficients of
in both sides, we can easily get the identities.
Theorem 2.16. For nonnegative integer n, we have
(56)
Proof From generating function (1), (14), we get
Comparing the coefficients of
in both sides, we can easily get the identities.
Theorem 2.17. For integer
, we have
(57)
Proof From generating function (1), (15), we get
Comparing the coefficients of
in both sides, we can easily get the identities.
3. Identities about High-Order Cauchy Polynomials
In this section, by means of the Riordan matrix, we derive some new equalities between High-order Cauchy polynomials and Striling numbers, Bell numbers, Bernoulli numbers, Lah numbers, Changhee numbers and so on.
Theorem 3.1. For nonnegative integer n, we have
(58)
Proof By Lemma 2 (29), we get
(59)
Corollary 3.1. For
in (58), we have
(60)
By means of Lemma 1, the inverse relation (27). This leads to the following conclusion.
Theorem 3.2. For nonnegative integer n, we have
(61)
Theorem 3.3. For nonnegative integer n, we have
(62)
Proof By (29), we get
(63)
which completes the proof.
By (27), we have
Theorem 3.4. For nonnegative integer n, we have
(64)
which completes the proof.
Theorem 3.5. For nonnegative integer n, we have
(65)
Proof By (29), we get
(66)
which completes the proof.
By (27), we have
Theorem 3.6. For integer
, we have
(67)
Theorem 3.7. For nonnegative integer
, we have
(68)
Proof By (29), we get
(69)
which completes the proof.
Theorem 3.8. For integer
, we have
(70)
Proof By (29), we get
(71)
which completes the proof.
Similarly, we can obtain
Theorem 3.9. For integer
, we have
(72)
Theorem 3.10. For nonnegative integer n, we have
(73)
(74)
(75)
(76)
Proof By (29), we get
(77)
(78)
We only prove the first equation.
which completes the proof.
Theorem 3.11. For nonnegative integer n, we have
(79)
Proof By (29), we get
(80)
which completes the proof.
Theorem 3.12. For nonnegative integer
, we have
(81)
Proof By (29), we get
(82)
which completes the proof.
Corollary 3.2. For
in (81), we have
(83)
Funding
Supported by the National Natural Science Foundation of China under Grant 11461050 and Natural Science Foundation of Inner Mongolia 2020MS01020.