Next Article in Journal
Selection of Logistics Service Provider for the E-Commerce Companies in Pakistan Based on Integrated GRA-TOPSIS Approach
Next Article in Special Issue
De Moivre’s and Euler Formulas for Matrices of Hybrid Numbers
Previous Article in Journal
Approximation of Directional Step Derivative of Complex-Valued Functions Using a Generalized Quaternion System
Previous Article in Special Issue
The Soliton Solutions for Some Nonlinear Fractional Differential Equations with Beta-Derivative
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Parametric Type of Cauchy Polynomials with Higher Level

Department of Mathematical Sciences, School of Science, Zhejiang Sci-Tech University, Hangzhou 310018, China
Axioms 2021, 10(3), 207; https://doi.org/10.3390/axioms10030207
Submission received: 8 August 2021 / Revised: 22 August 2021 / Accepted: 28 August 2021 / Published: 30 August 2021
(This article belongs to the Special Issue Advances in Mathematics and Its Applications)

Abstract

:
There are many kinds of generalizations of Cauchy numbers and polynomials. Recently, a parametric type of the Bernoulli numbers with level 3 was introduced and studied as a kind of generalization of Bernoulli polynomials. A parametric type of Cauchy numbers with level 3 is its analogue. In this paper, as an analogue of a parametric type of Bernoulli polynomials with level 3 and its extension, we introduce a parametric type of Cauchy polynomials with a higher level. We present their characteristic and combinatorial properties. By using recursions, we show some determinant expressions.
MSC:
11B75; 05A15; 05A19; 11C08; 15A15

1. Introduction

Let r 1 be an integer. For real numbers p , q , define bivariate Cauchy polynomials c n ( r , i ) ( p , q ) with higher level ( i = 0 , 1 , , r 1 ) as
t f q ( r , i ) ( t ) ( 1 + t ) p log ( 1 + t ) = n = 0 c n ( r , i ) ( p , q ) t n n ! ,
where
f q ( r , i ) ( t ) = n = 0 ( 1 ) n ( q t ) r n + i ( r n + i ) ! .
Their complementary polynomials c ^ n ( r , i ) ( p , q ) ( i = 0 , 1 , , r 1 ) are defined as
t f ^ q ( r , i ) ( t ) ( 1 + t ) p log ( 1 + t ) = n = 0 c ^ n ( r , i ) ( p , q ) t n n ! ,
where
f ^ q ( r , i ) ( t ) = n = 0 ( q t ) r n + i ( r n + i ) ! .
When q = i = 0 , c n ( x ) = c n ( r , 0 ) ( x , 0 ) = c ^ n ( r , 0 ) ( x , 0 ) is a Cauchy polynomial, defined by
t ( 1 + t ) x log ( 1 + t ) = n = 0 c n ( x ) t n n !
(cf. [1]). When p = q = i = 0 , c n = c n ( r , 0 ) ( 0 , 0 ) = c ^ n ( r , 0 ) ( 0 , 0 ) is the classical Cauchy number (cf. [2,3]), defined by
t log ( 1 + t ) = n = 0 c n t n n ! .
The numbers c n ( 1 ) are often called Cauchy numbers of the second kind. The sum of products of Cauchy numbers are studied in [4]. Some recurrence relations are studied in [5]. The Cauchy numbers are closely related to the harmonic polynomials, and the Cauchy polynomials are related to the Nörlund polynomials [1,6,7]. On the other hand, Cauchy numbers and polynomials are closely related to Bernoulli numbers B n and polynomials B n ( x ) , which are defined by
t e t x e t 1 = n = 0 B n ( x ) t n n ! ,
and B n = B n ( 0 ) . e t 1 and log ( 1 + t ) are inverse functions, and c n / n ! are often called Bernoulli numbers of the second kind [8]. Bernoulli numbers are expressed in terms of Stirling numbers of the second kind and Cauchy numbers are expressed in terms of Stirling numbers of the first kind [9].
There are many generalizations of Cauchy numbers, including higher-order numbers [10], degenerate Cauchy numbers and polynomials [11,12], poly-Cauchy numbers [9], and hypergeometric Cauchy numbers [13]. They may be analogues of degenerate Bernoulli numbers and polynomials [14], poly-Bernoulli numbers [15], and hypergeometric Bernoulli numbers [16,17,18], respectively. In this paper, we propose still a different kind of generalization of Cauchy numbers and polynomials.
When r = 1 , f q ( 1 , 0 ) = f q ( 1 , 0 ) ( t ) = e q t and f ^ q ( 1 , 0 ) = e q t . When r = 2 , f q ( 2 , 0 ) = cos q t and f ^ q ( 2 , 0 ) = cosh q t , f q ( 2 , 1 ) = sin q t and f ^ q ( 2 , 1 ) = sinh q t . When r = 3 ,
f q ( 3 , 0 ) = e q t + e q ω t + e q ω 2 t 3 , f ^ q ( 3 , 0 ) = e q t + e q ω t + e q ω 2 t 3 , f q ( 3 , 1 ) = e q t + ω 2 e q ω t + ω e q ω 2 t 3 , f ^ q ( 3 , 1 ) = e q t + ω 2 e q ω t + ω e q ω 2 t 3 , f q ( 3 , 2 ) = e q t + ω e q ω t + ω 2 e q ω 2 t 3 , f ^ q ( 3 , 2 ) = e q t + ω e q ω t + ω 2 e q ω 2 t 3 ,
where ω = 1 + 3 2 and ω 2 = ω ¯ = 1 3 2 are the primitive cube roots of unity.
In [19], by referring to Osler’s lemma [20], explicit forms of the two bivariate series involving sin and cos functions are obtained. Then, in [19], a parametric type of Bernoulli polynomials is introduced and their basic properties are studied [21]. More precisely, two kinds of bivariate Bernoulli polynomials are introduced as
t e p t e t 1 f q ( 2 , 0 ) = n = 0 B n ( 2 , 0 ) ( p , q ) t n n !
and
t e p t e t 1 f q ( 2 , 1 ) = n = 0 B n ( 2 , 1 ) ( p , q ) t n n ! .
Recently, in [22], three kinds of trivariate Bernoulli polynomials are studied. Such bivariate and trivariate Bernoulli polynomials are called the parametric type of Bernoulli polynomials with levels 2 and 3, respectively. In particular, some determinant expressions of these polynomials are also given.
In [23], two trigonometric extensions of bivariate Euler polynomials were introduced and several properties related to these extensions were established. In [24], two parametric-type families of the Fubini-type polynomials were introduced and studied. In [25], a type of generalized parametric Apostol–Bernoulli, Apostol–Euler, and Apostol–Genocchi polynomial was introduced and their basic properties were studied. In [26], the real and imaginary parts of a general set of complex Appell polynomials can be represented in terms of the Chebyshev polynomials of the first and second kind.
As an analogous generation of the classical Euler numbers, Lehmer [27] introduced and studied generalized Euler numbers W n , defined by the generating function
1 f 1 ( 3 , 0 ) = n = 0 W n t n n ! .
Notice that W n = 0 unless n 0 ( mod 3 ) . In [28], more general Lehmer’s-type Euler numbers were considered.
In [29], along with ideas about parametric Bernoulli polynomials mentioned above, a parametric type of Cauchy numbers with levels 2 and 3 is introduced and studied. However, such levels can be raised by an extension. In this paper, as an analogue of a parametric type of Bernoulli polynomials with level 3 and its extension, we introduce a parametric type of Cauchy polynomials with a higher level. We give their characteristic and combinatorial properties. By using recursions, we show some determinant expressions.
Since for i = 0 , 1 , , r 1
( 1 ) r n + i = ( 1 ) n + i if r is odd ; ( 1 ) i if r is even ,
we see that
f q ( r , i ) ( t ) = ( 1 ) i f ^ q ( r , i ) ( t ) if r is odd ; ( 1 ) i f q ( r , i ) ( t ) if r is even ,
f ^ q ( r , i ) ( t ) = ( 1 ) i f q ( r , i ) ( t ) if r is odd ; ( 1 ) i f ^ q ( r , i ) ( t ) if r is even .
It is clear to see the following.
Proposition 1.
For n 0 and i , j = 0 , 1 , , r 1 ,
c n ( r , i ) ( p , ζ r j q ) = ζ r i j c n ( r , i ) ( p , q ) , c ^ n ( r , i ) ( p , ζ r j q ) = ζ r i j c ^ n ( r , i ) ( p , q ) ,
where ζ is the primitive r-th root of unity.
In the next section, we show several properties of bivariate Cauchy polynomials with higher level. In particular, Theorem 1 entails fundamental recurrence formulas. By using these formulas, we give determinant expressions of bivariate Cauchy polynomials with higher levels. In special cases, we can get determinant expressions of the classical Cauchy polynomials and numbers.

2. Basic Properties

In this section, we show several properties of bivariate Cauchy polynomials with higher levels. We introduce the auxiliary polynomials G n ( r , i ) ( p , q ) and G ^ n ( r , i ) ( p , q ) as
f q ( r , i ) ( t ) ( 1 + t ) p = n = 0 G n ( r , i ) ( p , q ) t n n ! ,
f ^ q ( r , i ) ( t ) ( 1 + t ) p = n = 0 G ^ n ( r , i ) ( p , q ) t n n ! .
respectively.
Proposition 2.
For n 0 and i = 0 , 1 , , r 1 ,
G n ( r , i ) ( p , q ) = k = 0 n i r ( 1 ) k n r k + i ( p ) n r k i q r k + i ,
G ^ n ( r , i ) ( p , q ) = k = 0 n i r n r k + i ( p ) n r k i q r k + i ,
where ( x ) = x ( x 1 ) ( x + 1 ) ( 1 ) denotes the falling factorial with ( x ) 0 = 1 .
Proof. 
From the definition in (9), we have
n = 0 G n ( r , i ) ( p , q ) t n n ! = l = 0 ( p ) l t l l ! k = 0 ( 1 ) k ( q t ) r k + i ( r k + i ) ! = n = 0 k = 0 n i r ( 1 ) k n r k + i ( p ) n r k i q r k + i t n n ! .
The identity (11) is obtained by comparing the coefficients on both sides. The identity (12) is similarly proved. □
c n ( r , i ) ( p , q ) (respectively, c ^ n ( r , i ) ( p , q ) ) can be written in terms of G n ( r , i ) ( p , q ) (respectively, G ^ n ( r , i ) ( p , q ) ).
Proposition 3.
For n 0 and i = 0 , 1 , , r 1 ,
c n ( r , i ) ( p , q ) = k = 0 n n k c n k G k ( r , i ) ( p , q ) ,
c ^ n ( r , i ) ( p , q ) = k = 0 n n k c n k G ^ k ( r , i ) ( p , q ) .
Proof. 
n = 0 c ^ n ( r , i ) ( p , q ) t n n ! = t log ( 1 + t ) · f ^ q ( r , i ) ( t ) ( 1 + t ) p = l = 0 c l t l l ! k = 0 G k ( r , i ) ( p , q ) t k k ! = n = 0 k = 0 n n k c n k G k ( r , i ) ( p , q ) t n n ! .
The identity (14) is obtained by comparing the coefficients on both sides. The identity (13) is similarly proved. □
Contrary to Proposition 3, G n ( r , i ) ( p , q ) (respectively, G ^ n ( r , i ) ( p , q ) ) can be written in terms of c n ( r , i ) ( p , q ) (respectively, c ^ n ( r , i ) ( p , q ) ).
Proposition 4.
For n 0 and i = 0 , 1 , , r 1 ,
G n ( r , i ) ( p , q ) = k = 0 n ( 1 ) n k n ! ( n k + 1 ) k ! c k ( r , i ) ( p , q ) ,
G ^ n ( r , i ) ( p , q ) = k = 0 n ( 1 ) n k n ! ( n k + 1 ) k ! c ^ k ( r , i ) ( p , q ) .
Proof. 
n = 0 G n ( r , i ) ( p , q ) t n n ! = log ( 1 + t ) t k = 0 c k ( r , i ) ( p , q ) t k k ! = l = 0 ( 1 ) l t l l + 1 k = 0 c k ( r , i ) ( p , q ) t k k ! = n = 0 k = 0 n ( 1 ) n k n ! ( n k + 1 ) k ! c k ( r , i ) ( p , q ) t n n ! .
The identity (15) is obtained by comparing the coefficients on both sides. The identity (16) is similarly proved. □
We have a summation formula for c n ( r , i ) ( p , q ) (respectively, c ^ n ( r , i ) ( p , q ) ).
Theorem 1.
For n 0 and i = 0 , 1 , , r 1 ,
k = 0 n n + 1 k c k ( r , i ) ( p , q ) d d p ( p ) n k + 1
= ( 1 ) ( n i ) / r ( n + 1 ) q n i f n i ( mod r ) ; 0 o t h e r w i s e , k = 0 n n + 1 k c ^ k ( r , i ) ( p , q ) d d p ( p ) n k + 1
= ( n + 1 ) q n i f n i ( mod r ) ; 0 o t h e r w i s e .
When p = 0 in Theorem 1, by
d d p ( p ) n k + 1 p = 0 = ( 1 ) n k ( n k ) !
we have simpler recurrence relations.
Corollary 1.
For n 0 and i = 0 , 1 , , r 1 ,
k = 0 n ( 1 ) n k c k ( r , i ) ( p , q ) ( n k + 1 ) k ! = ( 1 ) ( n i ) / r q n n ! i f n i ( mod r ) ; 0 o t h e r w i s e , k = 0 n ( 1 ) n k c ^ k ( r , i ) ( p , q ) ( n k + 1 ) k ! = q n n ! i f n i ( mod r ) ; 0 o t h e r w i s e .
Proof of Theorem 1.
From the definition in (1) and the proof of Proposition 4, we have
f q ( r , i ) ( t ) = ( 1 + t ) p · log ( 1 + t ) t n = 0 c n ( r , i ) ( p , q ) t n n ! = m = 0 ( p ) m m ! t m l = 0 k = 0 l ( 1 ) l k + 1 ( l k + 1 ) k ! c k ( r , i ) ( p , q ) t l = n = 0 l = 0 n ( p ) n l ( n l ) ! k = 0 l ( 1 ) l k + 1 n ! ( l k + 1 ) k ! c k ( r , i ) ( p , q ) t n n ! = n = 0 k = 0 n c k ( r , i ) ( p , q ) l = k n n l l k ( p ) n l ( l k + 1 ) t n n ! = n = 0 k = 0 n ( 1 ) k 1 c k ( r , i ) ( p , q ) k ! l = k n ( 1 ) l n ! ( p ) n l ( l k + 1 ) ( n l ) ! t n n ! = n = 0 k = 0 n ( 1 ) k 1 c k ( r , i ) ( p , q ) k ! ( 1 ) n n ! j = 0 n k ( 1 ) j ( p ) j ( n k j + 1 ) j ! t n n ! .
Since
j = 0 n k ( 1 ) j ( p ) j ( n k j + 1 ) j ! = 1 ( n k + 1 ) ! l = 0 n k ( 1 ) l ( l + 1 ) n k + 1 l + 1 p l = 1 ( n k + 1 ) ! d d p ( 1 ) n k ( p ) n k + 1 ,
where n k denotes the (unsigned) Stirling numbers of the first kind as in
( x ) n = k = 0 n ( 1 ) n k n k x k ,
comparing the coefficients with
f q ( r , i ) ( t ) = n = 0 ( 1 ) n ( q t ) r n + i ( r n + i ) !
in (2), we get the identity (17). The identity (18) is similarly proved. □
From Theorem 1, we have the recurrence relations
c n ( r , i ) ( p , q ) = n ! k = 0 n 1 c k ( r , i ) ( p , q ) k ! d d p ( p ) n k + 1 ( n k + 1 ) !
( 1 ) ( n i ) / r q n if n i ( mod r ) ; 0 otherwise , c ^ n ( r , i ) ( p , q ) = n ! k = 0 n 1 c ^ k ( r , i ) ( p , q ) k ! d d p ( p ) n k + 1 ( n k + 1 ) !
q n if n i ( mod r ) ; 0 otherwise
with
c 0 ( r , i ) ( p , q ) = c ^ 0 ( r , i ) ( p , q ) = 1 if i = 0 ; 0 if i = 1 , 2 .
By using recursions, we can get the exact values of c n ( r , i ) ( p , q ) and c ^ n ( r , i ) ( p , q ) for small n. We list some initial values in the Appendix A.
Theorem 2.
For n 0 and i = 0 , 1 , , r 1 ,
c n ( r , i ) ( p + 1 , q ) c n ( r , i ) ( p , q ) = n c n 1 ( r , i ) ( p + 1 , q ) ,
c ^ n ( r , i ) ( p + 1 , q ) c ^ n ( r , i ) ( p , q ) = n c ^ n 1 ( r , i ) ( p + 1 , q ) .
Proof. 
n = 0 c n ( r , i ) ( p + 1 , q ) t n n ! n = 0 c n ( r , i ) ( p , q ) t n n ! = t f q ( r , i ) ( t ) ( 1 + t ) p + 1 log ( 1 + t ) t f q ( r , i ) ( t ) ( 1 + t ) p log ( 1 + t ) = t 2 f q ( r , i ) ( t ) ( 1 + t ) p + 1 log ( 1 + t ) = t n = 0 c n ( r , i ) ( p + 1 , q ) t n n ! = n = 0 n c n 1 ( r , i ) ( p + 1 , q ) t n n ! .
The identity (21) is obtained by comparing the coefficients on both sides. The identity (22) is similarly proved. □
Theorem 3.
For n 0 and i = 0 , 1 , , r 1 ,
c n ( r , i ) ( p + s , q ) = k = 0 n n k c k ( r , i ) ( p , q ) ( s ) n k ,
c ^ n ( r , i ) ( p + s , q ) = k = 0 n n k c ^ k ( r , i ) ( p , q ) ( s ) n k .
Proof. 
n = 0 c n ( r , i ) ( p + s , q ) t n n ! = t f q ( r , i ) ( t ) ( 1 + t ) p + s log ( 1 + t ) = n = 0 c n ( r , i ) ( p , q ) t n n ! l = 0 ( s ) l t l l ! = n = 0 k = 0 n n k c k ( r , i ) ( p , q ) ( s ) n k t n n ! .
The identity (23) is obtained by comparing the coefficients on both sides. The identity (24) is similarly proved. □
Theorem 4.
For n 0 and i = 0 , 1 , , r 1 ,
k = 0 n c k ( r , i ) ( p , q ) k ! = c n ( r , i ) ( p + 1 , q ) n ! ,
k = 0 n c ^ k ( r , i ) ( p , q ) k ! = c ^ n ( r , i ) ( p + 1 , q ) n ! .
Proof. 
By using Theorem 3 (23) with r = 1 and r = 0 ,
c n + 1 ( r , i ) ( p + 1 , q ) c n + 1 ( r , i ) ( p , q ) = k = 0 n n + 1 k c k ( r , i ) ( p , q ) · ( 1 ) n k + 1 ( n k + 1 ) ! = ( n + 1 ) ! k = 0 n ( 1 ) n k + 1 c k ( r , i ) ( p , q ) k ! .
Together with Theorem 2 (21), we get the identity (25). The identity (26) is similarly proved. □
Theorem 5.
For n 1 ,
p c n ( r , i ) ( p , q ) = k = 0 n 1 ( 1 ) n k 1 c k ( r , i ) ( p , q ) ( n k ) k ! ( i = 0 , 1 , , r 1 ) ,
q c n ( r , i ) ( p , q ) = n c n 1 ( r , r 1 ) ( p , q ) i f i = 0 ; n c n 1 ( r , i 1 ) ( p , q ) i f i = 1 , 2 , , r 1 ,
p c ^ n ( r , i ) ( p , q ) = k = 0 n 1 ( 1 ) n k 1 c ^ k ( r , i ) ( p , q ) ( n k ) k ! ( i = 0 , 1 , , r 1 ) ,
q c ^ n ( r , i ) ( p , q ) = n c ^ n 1 ( r , r 1 ) ( p , q ) i f i = 0 ; n c ^ n 1 ( r , i 1 ) ( p , q ) i f i = 1 , 2 , , r 1 .
Proof. 
n = 1 p c n ( r , i ) ( p , q ) t n n ! = t f q ( r , i ) ( t ) ( 1 + t ) p = m = 1 ( 1 ) m 1 t m m ! n = 0 c n ( r , i ) ( p , q ) t n n ! = n = 0 k = 0 n 1 ( 1 ) n k 1 c k ( r , i ) ( p , q ) ( n k ) k ! t n n ! ,
yielding (27). Since
q f q ( r , 0 ) ( t ) = t n = 1 ( 1 ) n ( q t ) r n 1 ( r n 1 ) ! = t f q ( r , r 1 ) ( t )
and
q f q ( r , i ) ( t ) = t f q ( r , i 1 ) ( t ) ( i = 1 , 2 , , r 1 ) ,
we get (28). The identities (29) and (30) are similarly proved. □

3. Determinants

Bivariate Cauchy polynomials c n ( r , 0 ) ( p , q ) with a higher level and their complementary numbers c ^ n ( r , 0 ) ( p , q ) have determinant expressions.
Theorem 6.
For n i + 1 ,
c n ( r , i ) ( p , q ) = q i n ! i ! r p ( 2 ) 1 0 0 r p ( 3 ) r p ( 2 ) 1 0 r p ( n i ) r p ( n i 1 ) r p ( 2 ) 1 r p * ( n i + 1 ) r p * ( n i ) r p * ( 3 ) r p * ( 2 )
and
c ^ n ( r , 0 ) ( p , q ) = q i n ! i ! r p ( 2 ) 1 0 0 r p ( 3 ) r p ( 2 ) 1 0 r p ( n i ) r p ( n i 1 ) r p ( 2 ) 1 r ^ p ( n i + 1 ) r ^ p ( n i ) r ^ p ( 3 ) r ^ p ( 2 ) ,
where
r p ( n ) = d d p ( 1 ) n 1 ( p ) n n ! = 1 n ! = 0 n 1 ( 1 ) ( + 1 ) n + 1 p
with
r p * ( n ) = r p ( n ) ( 1 ) n + ( n 1 ) / r i ! q n 1 ( n + i 1 ) ! if n 1 ( mod r ) ; 0 otherwise ( n 2 )
and
r ^ p ( n ) = r p ( n ) + ( 1 ) n i ! q n 1 ( n + i 1 ) ! if n 1 ( mod r ) ; 0 otherwise ( n 2 ) .
Proof. 
From Theorem 1 with the recurrence relation in (19), putting
γ n : = i ! q i c n ( r , i ) ( p , q ) n ! ,
we have
γ n = k = i n 1 ( 1 ) n k + 1 r p ( n k + 1 ) γ k ( 1 ) ( n i ) / r i ! q n i n ! if n i ( mod r ) ; 0 otherwise .
Notice that γ 0 = = γ i 1 = 0 and γ i = 1 since c 0 ( r , i ) ( p , q ) = = c i 1 ( r , i ) ( p , q ) = 0 and c i ( r , i ) ( p , q ) = q i . By induction, we shall prove that
γ n = r p ( 2 ) 1 0 0 r p ( 3 ) r p ( 2 ) 1 0 r p ( n i ) r p ( n i 1 ) r p ( 2 ) 1 r ^ p ( n i + 1 ) r ^ p ( n i ) r ^ p ( 3 ) r ^ p ( 2 ) .
For n = i + 1 , by the recurrence relation (31), we get
γ i + 1 = r p ( 2 ) = | r p ( 2 ) | .
Assume that the determinant expression of (32) is valid up to n 1 . Then, by expanding the right-hand-side of (32) along the first row repeatedly, we have
r p ( 2 ) γ n 1 r p ( 3 ) 1 0 0 r p ( 4 ) r p ( 2 ) 1 0 r p ( n i ) r p ( n i 2 ) r p ( 2 ) 1 r p * ( n i + 1 ) r p * ( n i 1 ) r p * ( 3 ) r p * ( 2 ) = r p ( 2 ) γ n 1 r p ( 3 ) γ n 2 + + ( 1 ) n i 1 r p ( n 1 ) γ i + 2 + ( 1 ) n i r p ( n i ) 1 r p * ( n i + 1 ) r p * ( 2 ) = r p ( 2 ) γ n 1 r p ( 3 ) γ n 2 + + ( 1 ) n i 1 r p ( n 1 ) γ i + 2 + ( 1 ) n i r p ( n ) γ i + 1 + ( 1 ) n i + 1 r p * ( n i + 1 ) γ i = γ n .
The last identity is entailed from the recurrence relation (31) and
r p * ( n i + 1 ) = r p ( n i + 1 ) + ( 1 ) n i + 1 ( 1 ) ( n i ) / r q n i n !
for n i ( mod r ) . By putting m = n i + 1 , we find that
r p * ( m ) = r p ( m ) ( 1 ) m + ( m 1 ) / r i ! q m 1 ( m + i 1 ) !
for m 1 ( mod r ) . In addition,
j = 0 n k ( 1 ) j ( p ) j ( n k j + 1 ) j ! = 1 ( n k + 1 ) ! l = 0 n k ( 1 ) l ( l + 1 ) n k + 1 l + 1 p l = 1 ( n k + 1 ) ! d d p ( 1 ) n k ( p ) n k + 1 .
Another identity can be yielded similarly from the recurrence relation
γ ^ n = k = i n 1 ( 1 ) n k + 1 r p ( n k + 1 ) γ ^ k + i ! q n i n ! if n i ( mod r ) ; 0 otherwise ,
with
γ ^ n : = i ! q i c ^ n ( r , i ) ( p , q ) n ! .
When q = i = 0 in Theorem 6, a simpler determinant expression of Cauchy polynomials c n ( p ) : = c n ( r , 0 ) ( p , 0 ) = c ^ n ( r , 0 ) ( p , 0 ) is given. For simplification of determinant expressions, we use the Jordan matrix
J = 0 0 0 0 1 0 0 0 0 1 0 0 0 0 1 0
J 0 is an identity matrix and J T is the transpose matrix of J.
Corollary 2.
For n 1 ,
c n ( p ) = c ^ n ( p ) = n ! J T + k = 1 n r p ( k + 1 ) J k 1 .
Remark 1.
When p = 0 in Corollary 2, by
r 0 ( n ) = d d p ( 1 ) n 1 ( p ) n n ! p = 0 = 1 n ,
we have a determinant expression of Cauchy numbers c n as
c n = n ! J T + k = 1 n 1 k + 1 J k 1
(p. 50 [30]).
We need the following equivalent relations (see, e.g., [31]).
Lemma 1.
k = 0 n ( 1 ) n k x n k z k = 0 with x 0 = z 0 = 1
x n = J T + k = 1 n z k J k 1 z n = J T + k = 1 n x k J k 1 .
By using Lemma 1 again, we have the inversion relation of Corollary 2.
Corollary 3.
For n 1 ,
r p ( n + 1 ) = J T + k = 1 n c k ( p ) k ! J k 1 .
We shall use Trudi’s formula to obtain different explicit expressions and inversion relations for the numbers c n ( r , i ) ( p , 0 ) .
Lemma 2.
For n 1 , we have
a 0 J T + k = 1 n a k J k 1 = t 1 + 2 t 2 + + n t n = n t 1 + + t n t 1 , , t n ( a 0 ) n t 1 t n a 1 t 1 a 2 t 2 a n t n ,
where t 1 + + t n t 1 , , t n = ( t 1 + + t n ) ! t 1 ! t n ! are the multinomial coefficients.
This relation is known as Trudi’s formula [32] (Volume 3, p. 214), [33] and the case a 0 = 1 of this formula is known as Brioschi’s formula [34], (Volume 3, pp. 208–209) [32].
By Corollaries 2 and 3 with Lemma 2, we get different expressions of c n ( p ) and r p ( n ) .
Corollary 4.
For n 1 ,
c n ( p ) = t 1 + 2 t 2 + + n t n = n t 1 + + t n t 1 , , t n × ( 1 ) n t 1 t n r p ( 2 ) t 1 r p ( 3 ) t 2 r p ( n + 1 ) t n , r p ( n + 1 ) = t 1 + 2 t 2 + + n t n = n t 1 + + t n t 1 , , t n × ( 1 ) n t 1 t n c 1 ( p ) t 1 c 2 ( p ) 2 ! t 2 c n ( p ) n ! t n .

4. Discussion

Cauchy numbers and polynomials have been often considered and studied in relation to Bernoulli polynomials and numbers. There are many generalizations of Cauchy polynomials. In particular, poly-Cauchy numbers are analogues of poly-Bernoulli numbers, and hypergeometric Cauchy numbers are analogues of hypergeometric Bernoulli numbers. Recently, parametric types of Cauchy polynomials with level 2 (bivariate) and level 3 (trivariate) are introduced and studied as analogues of parametric types of Bernoulli polynomials with level 2 and level 3, respectively. In this paper, such a concept is totally generalized as Cauchy polynomials with a higher level. We give their characteristic and combinatorial properties, including determinant expressions.

Funding

This research received no external funding.

Data Availability Statement

Not applicable.

Acknowledgments

The author thanks the anonymous referees for careful reading of the manuscript and useful suggestions.

Conflicts of Interest

The author declares no conflict of interest.

Appendix A

By using recursions in (19) and (20) or the determinant expressions in Theorem 6, we can get the exact values of c n ( r , i ) ( p , q ) and c ^ n ( r , i ) ( p , q ) for small n. We list some initial values.
c 0 ( 3 , 0 ) ( p , q ) = 1 , c 1 ( 3 , 0 ) ( p , q ) = p + 1 2 , c 2 ( 3 , 0 ) ( p , q ) = p 2 1 6 , c 3 ( 3 , 0 ) ( p , q ) = p 3 3 p 2 2 q 3 + 1 4 , c 4 ( 3 , 0 ) ( p , q ) = p 4 + 4 p 3 + 4 p 2 + 4 q 3 p 2 q 3 19 30 , c 5 ( 3 , 0 ) ( p , q ) = p 5 15 p 4 2 55 p 3 3 5 ( 2 q 3 + 3 ) p 2 + 5 q 3 3 + 9 4 , c 6 ( 3 , 0 ) ( p , q ) = p 6 + 12 p 5 + 105 p 4 2 + 20 ( q 3 + 5 ) p 3 + 6 ( 5 q 3 + 12 ) p 2 + q 6 5 q 3 863 84 .
c 0 ( 3 , 1 ) ( p , q ) = 0 , c 1 ( 3 , 1 ) ( p , q ) = q , c 2 ( 3 , 1 ) ( p , q ) = 2 q p + q , c 3 ( 3 , 1 ) ( p , q ) = 3 q p 2 q 2 , c 4 ( 3 , 1 ) ( p , q ) = 4 q p 3 + 6 q p 2 q 4 + q , c 5 ( 3 , 1 ) ( p , q ) = 5 q p 4 + 20 q p 3 + 20 q p 2 + 5 q 4 p 5 q 4 2 19 q 6 , c 6 ( 3 , 1 ) ( p , q ) = 6 q p 5 45 q p 4 110 q p 3 15 q ( q 3 + 6 ) p 2 + 5 q 4 2 + 27 q 2 .
c 0 ( 3 , 2 ) ( p , q ) = 0 , c 1 ( 3 , 2 ) ( p , q ) = 0 , c 2 ( 3 , 2 ) ( p , q ) = q 2 , c 3 ( 3 , 2 ) ( p , q ) = 3 q 2 p + 3 q 2 2 , c 4 ( 3 , 2 ) ( p , q ) = 6 q 2 p 2 q 2 , c 5 ( 3 , 2 ) ( p , q ) = 10 q 2 p 3 15 q 2 p 2 q 5 + 5 q 2 2 , c 6 ( 3 , 2 ) ( p , q ) = 15 q 2 p 4 + 60 q 2 p 3 + 60 q 2 p 2 + 6 q 5 p 3 q 5 19 q 2 2 .
c ^ 0 ( 3 , 0 ) ( p , q ) = 1 , c ^ 1 ( 3 , 0 ) ( p , q ) = p + 1 2 , c ^ 2 ( 3 , 0 ) ( p , q ) = p 2 1 6 , c ^ 3 ( 3 , 0 ) ( p , q ) = p 3 3 p 2 2 + q 3 + 1 4 , c ^ 4 ( 3 , 0 ) ( p , q ) = p 4 + 4 p 3 + 4 p 2 4 q 3 p + 2 q 3 19 30 , c ^ 5 ( 3 , 0 ) ( p , q ) = p 5 15 p 4 2 55 p 3 3 + 5 ( 2 q 3 3 ) p 2 5 q 3 3 + 9 4 , c ^ 6 ( 3 , 0 ) ( p , q ) = p 6 + 12 p 5 + 105 p 4 2 20 ( q 3 5 ) p 3 6 ( 5 q 3 12 ) p 2 + q 6 + 5 q 3 863 84 .
c ^ 0 ( 3 , 1 ) ( p , q ) = 0 , c ^ 1 ( 3 , 1 ) ( p , q ) = q , c ^ 2 ( 3 , 1 ) ( p , q ) = 2 q p + q , c ^ 3 ( 3 , 1 ) ( p , q ) = 3 q p 2 q 2 , c ^ 4 ( 3 , 1 ) ( p , q ) = 4 q p 3 + 6 q p 2 + q 4 + q , c ^ 5 ( 3 , 1 ) ( p , q ) = 5 q p 4 + 20 q p 3 + 20 q p 2 5 q 4 p + 5 q 4 2 19 q 6 , c ^ 6 ( 3 , 1 ) ( p , q ) = 6 q p 5 45 q p 4 110 q p 3 + 15 q ( q 3 6 ) p 2 5 q 4 2 + 27 q 2 .
c ^ 0 ( 3 , 2 ) ( p , q ) = 0 , c ^ 1 ( 3 , 2 ) ( p , q ) = 0 , c ^ 3 ( 3 , 2 ) ( p , q ) = 3 q 2 p + 3 q 2 2 , c ^ 4 ( 3 , 2 ) ( p , q ) = 6 q 2 p 2 q 2 , c ^ 5 ( 3 , 2 ) ( p , q ) = 10 q 2 p 3 15 q 2 p 2 + q 5 + 5 q 2 2 , c ^ 6 ( 3 , 2 ) ( p , q ) = 15 q 2 p 4 + 60 q 2 p 3 + 60 q 2 p 2 6 q 5 p + 3 q 5 19 q 2 2 .

References

  1. Cheon, G.-S.; Hwang, S.-G.; Lee, S.-G. Several polynomials associated with the harmonic numbers. Discrete Appl. Math. 2007, 155, 2573–2584. [Google Scholar] [CrossRef] [Green Version]
  2. Comtet, L. Advanced Combinatorics; Riedel: Dordrech, The Netherlands; Boston, MA, USA, 1974. [Google Scholar]
  3. Merlini, D.; Sprugnoli, R.; Verri, M.C. The Cauchy numbers. Discrete Math. 2006, 306, 1906–1920. [Google Scholar] [CrossRef] [Green Version]
  4. Zhao, F.-Z. Sums of products of Cauchy numbers. Discrete Math. 2009, 309, 3830–3842. [Google Scholar] [CrossRef] [Green Version]
  5. Agoh, T.; Dilcher, K. Recurrence relations for Nörlund numbers and Bernoulli numbers of the second kind. Fibonacci Quart. 2010, 48, 4–12. [Google Scholar]
  6. Liu, G.-D.; Srivastava, H.M. Explicit formulas for the Norlund polynomials Bn(x) and bn(x). Comput. Math. Appl. 2006, 51, 1377–1384. [Google Scholar] [CrossRef] [Green Version]
  7. Nörlund, N.E. Vorlesungen über Differenzenrechnung; Springer: Berlin, Germany, 1924. [Google Scholar]
  8. Howard, F.T. Explicit formulas for degenerate Bernoulli numbers. Discrete Math. 1996, 162, 175–185. [Google Scholar] [CrossRef] [Green Version]
  9. Komatsu, T. Poly-Cauchy numbers. Kyushu J. Math. 2013, 67, 143–153. [Google Scholar] [CrossRef] [Green Version]
  10. Wang, H.; Liu, G. An explicit formula for higher order Bernoulli polynomials of the second kind. Integers 2013, 13, 1–7. [Google Scholar]
  11. Cenkci, M.; Howard, F.T. Notes on degenerate numbers. Discrete Math. 2007, 307, 2359–2375. [Google Scholar] [CrossRef]
  12. Howard, F.T. Degenerate weighted Stirling numbers. Discrete Math. 1985, 57, 45–58. [Google Scholar] [CrossRef] [Green Version]
  13. Komatsu, T. Hypergeometric Cauchy numbers. Int. J. Number Theory 2013, 9, 545–560. [Google Scholar] [CrossRef]
  14. Carlitz, L. Degenerate Stirling, Bernoulli, and Eulerian numbers. Utilitas Math. 1979, 15, 51–88. [Google Scholar]
  15. Kaneko, M. Poly-Bernoulli numbers. J. Théor. Nombres Bordx. 1997, 9, 199–206. [Google Scholar] [CrossRef]
  16. Hassen, A.; Nguyen, H.D. Hypergeometric Bernoulli polynomials and Appell sequences. Int. J. Number Theory 2008, 4, 767–774. [Google Scholar] [CrossRef] [Green Version]
  17. Hassen, A.; Nguyen, H.D. Hypergeometric zeta functions. Int. J. Number Theory 2010, 6, 99–126. [Google Scholar] [CrossRef] [Green Version]
  18. Kamano, K. Sums of products of hypergeometric Bernoulli numbers. J. Number Theory 2010, 130, 2259–2271. [Google Scholar] [CrossRef] [Green Version]
  19. Masjed-Jamei, M.; Beyki, M.R.; Koepf, W. Symbolic computation of some power-trigonometric series. J. Symb. Comput. 2017, 80, 273–284. [Google Scholar] [CrossRef]
  20. Osler, T.J. An identity for simplifying certain generalized hypergeometric functions. Math. Comput. 1975, 29, 888–893. [Google Scholar]
  21. Masjed-Jamei, M.; Beyki, M.R.; Koepf, W. An extension of the Euler-Maclaurin quadrature formula using a parametric type of Bernoulli polynomials. Bull. Sci. Math. 2019, 156, 102798. [Google Scholar] [CrossRef]
  22. Komatsu, T. A parametric type of Bernoulli polynomials with level 3. Rev. R. Acad. Cienc. Exactas Fis. Nat. Ser. A Mat. RACSAM 2020, 114. Paper No. 151. [Google Scholar] [CrossRef]
  23. Masjed-Jamei, M.; Beyki, M.R.; Koepf, W. A new type of Euler polynomials and numbers. Mediterr. J. Math. 2018, 15, 1–17. [Google Scholar] [CrossRef]
  24. Srivastava, H.M.; Kízílateş, C. A parametric kind of the Fubini-type polynomials. Rev. R. Acad. Cienc. Exactas Fis. Nat. Ser. A Mat. RACSAM 2019, 113, 3253–3267. [Google Scholar] [CrossRef]
  25. Srivastava, H.M.; Masjed-Jamei, M.; Beyki, M.R. Some new generalizations and applications of the Apostol-Bernoulli, Apostol-Euler and Apostol-Genocchi polynomials. Rocky Mt. J. Math. 2019, 49, 681–697. [Google Scholar] [CrossRef]
  26. Srivastava, H.M.; Ricci, P.E.; Natalini, P. A family of complex Appell polynomial sets. Rev. R. Acad. Cienc. Exactas Fis. Nat. Ser. A Mat. RACSAM 2019, 113, 2359–2371. [Google Scholar] [CrossRef]
  27. Lehmer, D.H. Lacunary recurrence formulas for the numbers of Bernoulli and Euler. Ann. Math. 1935, 36, 637–649. [Google Scholar] [CrossRef]
  28. Barman, R.; Komatsu, T. Lehmer’s generalized Euler numbers in hypergeometric functions. J. Korean Math. Soc. 2019, 56, 485–505. [Google Scholar]
  29. Komatsu, T. A parametric type of Cauchy polynomials with level 3. Miskolc Math. Notes. accepted for publication MMN-3652.
  30. Glaisher, J.W.L. Expressions for Laplace’s coefficients, Bernoullian and Eulerian numbers etc. as determinants. Messenger (2) 1875, 6, 49–63. [Google Scholar]
  31. Komatsu, T.; Ramirez, J.L. Some Determinants Involving Incomplete Fubini Numbers. An. Ştiinţ. Univ. “Ovidius” Constanţa Ser. Mat. 2018, 26, 147–153. Available online: https://www.sciendo.com/article/10.2478/auom-2018-0038 (accessed on 1 August 2021). [CrossRef] [Green Version]
  32. Muir, T. The Theory of Determinants in the Historical Order of Development; Dover Publications: New York, NY, USA, 1960; Volume 4. [Google Scholar]
  33. Trudi, N. Intorno ad alcune formole di sviluppo. Rendic. Dell’ Accad. Napoli 1862, 135–143. [Google Scholar]
  34. Brioschi, F. Sulle funzioni Bernoulliane ed Euleriane. Ann. Mat. Pura Appl. 1858, 1, 260–263. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Komatsu, T. A Parametric Type of Cauchy Polynomials with Higher Level. Axioms 2021, 10, 207. https://doi.org/10.3390/axioms10030207

AMA Style

Komatsu T. A Parametric Type of Cauchy Polynomials with Higher Level. Axioms. 2021; 10(3):207. https://doi.org/10.3390/axioms10030207

Chicago/Turabian Style

Komatsu, Takao. 2021. "A Parametric Type of Cauchy Polynomials with Higher Level" Axioms 10, no. 3: 207. https://doi.org/10.3390/axioms10030207

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