Next Article in Journal
Almost α-Kenmotsu Pseudo-Riemannian Manifolds with CR-Integrable Structure
Next Article in Special Issue
Monomiality and a New Family of Hermite Polynomials
Previous Article in Journal
A Highly Efficient Infinity-Shaped Large Angular- and Polarization-Independent Metamaterial Absorber
Previous Article in Special Issue
Bell’s Polynomials and Laplace Transform of Higher Order Nested Functions
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Poly-Cauchy Numbers with Higher Level

by
Takao Komatsu
1,* and
Víctor F. Sirvent
2
1
Department of Mathematical Sciences, School of Science, Zhejiang Sci-Tech University, Hangzhou 310018, China
2
Departamento de Matemáticas, Universidad Católica del Norte, Angamos 0610, Antofagasta 1240000, Chile
*
Author to whom correspondence should be addressed.
Symmetry 2023, 15(2), 354; https://doi.org/10.3390/sym15020354
Submission received: 28 December 2022 / Revised: 15 January 2023 / Accepted: 20 January 2023 / Published: 28 January 2023
(This article belongs to the Special Issue Theory and Applications of Special Functions II)

Abstract

:
In this article, mainly from the analytical aspect, we introduce poly-Cauchy numbers with higher levels (level s) as a kind of extensions of poly-Cauchy numbers with level 2 and the original poly-Cauchy numbers and investigate their properties. Such poly-Cauchy numbers with higher levels are yielded from the inverse relationship with an s-step function of the exponential function. We show such a function with recurrence relations and give the expressions of poly-Cauchy numbers with higher levels. Poly-Cauchy numbers with higher levels can be also expressed in terms of iterated integrals and a combinatorial summation. Poly-Cauchy numbers with higher levels for negative indices have a double summation formula. In addition, Cauchy numbers with higher levels can be also expressed in terms of determinants.
MSC:
11B75; 11B37; 05A15; 05A19

1. Introduction

The Stirling numbers with higher level (level s) were first studied by Tweedie [1] in 1918. Namely, those of the first kind  n k s  and the second kind  n k s  appeared as
x ( x + 1 s ) ( x + 2 s ) ( x + ( n 1 ) s ) = k = 0 n n k s x k
and
x n = k = 0 n n k s x ( x 1 s ) ( x 2 s ) x ( k 1 ) s ,
respectively. They satisfy the recurrence relations
n k s = n 1 k 1 s + ( n 1 ) s n 1 k s
and
n k s = n 1 k 1 s + k n 1 k s
with  0 0 s = 0 0 s = 1  and  n 0 s = n 0 s = 0  ( n 1 ). When  s = 1 , they are the original Stirling numbers of both kinds. When  s = 2 , they have been often studied as central factorial numbers of both kinds (see, e.g., [2]). The concept introduced by Tweedie This concept was used by Bell [3] to show a generalization of Lagrange and Wilson theorems. However, such generalized Stirling numbers have been forgotten or ignored for a long time.
Recently in [4,5], the Stirling numbers with higher levels have been rediscovered and studied more deeply, in particular, from the aspects of combinatorics. On the other hand, in [6], by using the Stirling numbers of the first kind with level 2, poly-Cauchy numbers with level 2 are introduced as a kind of generalizations of the original poly-Cauchy numbers, which may be interpreted as a kind of generalizations of the classical Cauchy numbers. In [7], by using the Stirling numbers of the second kind with level 2, poly-Bernoulli numbers with level 2 are introduced as a kind of generalizations of the original poly-Bernoulli numbers [8]. In [9], other poly-generalized numbers, which are called polycosecant numbers, are introduced and studied. This result leads to a variant of multiple zeta values of level 2 [10], which forms a subspace of the space of alternating multiple zeta values. However, no generalized Stirling number is considered in [9].
Another of the most famous generalized Stirling numbers is the r-Stirling number [11], which has meaningful relations with harmonic numbers from the summation formulas [12,13,14]. By using r-Stirling numbers, so-called various r-numbers are introduced.
It is remarkable to see that the original poly-Cauchy numbers (with level 1, ref. [15]), which may be also yielded by the logarithm function (an 1-step function) with the inverse relation of the exponential function. This can be said to be an analytical definition. Then, poly-Cauchy numbers with level 2 may be yielded or defined from the inverse relation about the hyperbolic sine function, which is a 2-step function of the exponential function [6]. Then, it would be a natural question how the poly-Cauchy numbers with level 3, 4, and generally level s can be defined by any functions (3, 4 and generally s-step functions, respectively) in a natural way.
In combinatorial ways, just as poly-Cauchy number with level 2 arises from the relationship with the Stirling numbers with level 2, poly-Cauchy number with level 3, 4 and generally level s could be hoped to arise from the Stirling numbers with level 3, 4 and generally level s, respectively. However, in the case of 3 or higher level, it is not easy to define and describe most of the properties including both combinatorial and analytical meanings naturally as well as those with levels 1 and 2. For example,
n k s = s ( s k ) ! j = 1 k ( 1 ) k j s k k j j s n
holds for  s = 1 , 2  and does not for  s 3  ([5]).
The purpose of this paper is to define poly-Cauchy numbers with higher level (level s) from the analytical implications and investigate their properties. Such poly-Cauchy numbers with higher levels are yielded from the inverse relationship with an s-step function of the exponential function. We show such a function with recurrence relations and give the expressions of poly-Cauchy numbers with higher levels. Poly-Cauchy numbers with higher levels can be also expressed in terms of iterated integrals and a combinatorial summation. Poly-Cauchy numbers with higher levels for negative indices have a double summation formula. In addition, Cauchy numbers with higher levels can be also expressed in terms of determinants.

2. Definitions

For integers n and k with  n 0 , poly-Cauchy numbers C n , s ( k ) with levels ( s 1 ) are defined by
Lif s , k AF s ( t ) = n = 0 C n , s ( k ) t n n ! ,
where
Lif s , k ( z ) = m = 0 z s m ( s m ) ! ( s m + 1 ) k .
The function  AF s ( t )  is the inverse function of
F s ( t ) = m = 0 t s m + 1 ( s m + 1 ) ! .
When  s = 1 C n , 1 ( k ) = c n ( k )  are the original poly-Cauchy numbers [15,16], defined by
Lif k AF 1 ( t ) = n = 0 c n ( k ) t n n ! ,
where  Lif 1 , k ( z ) = Lif k ( z )  is the polylogarithm factorial function (or polyfactorial function) and  AF 1 ( t ) = log ( t + 1 )  is the inverse function of
m = 0 t m + 1 ( m + 1 ) ! = e t 1 .
When  k = 1 c n = c n ( 1 )  are the original Cauchy numbers defined by
Lif 1 log ( t + 1 ) = t log ( t + 1 ) = n = 0 c n t n n ! .
When  s = 2 C n , 2 ( k ) = C n ( k )  are poly-Cauchy numbers with level 2 [6], defined by
Lif 2 , k AF 2 ( t ) = n = 0 C n ( k ) t n n ! ,
where  AF 2 ( t ) = arcsinh t  is the inverse function of
m = 0 t 2 m + 1 ( 2 m + 1 ) ! = sinh t
When  k = 1 C n = C n ( 1 )  are Cauchy numbers with level 2, defined by
Lif 2 , 1 arcsinh t = t arcsinh t = n = 0 C n t n n ! .
When  k = 1  and  s = 3 ,
Lif 3 , 1 ( z ) = e z + ω 2 e ω z + ω e ω 2 z 3 z = F 3 ( z ) z ,
where
F 3 ( z ) = m = 0 z 3 m + 1 ( 3 m + 1 ) ! .
and  ω = ( 1 + 3 ) / 2 , satisfying  ω 3 = 1 . Note that a similar function to  1 / F 3 ( z )  is studied in [17].
For an arbitrary  s 1  and  k = 1 , we have
Lif s , 1 ( z ) = m = 0 z s m ( s m + 1 ) ! = 1 s z j = 0 s 1 ζ j e ζ s j z = F s ( z ) z ,
where  ζ = e 2 π i / s , is the s-th root of the identity. The function  Lif s , 1 ( z )  becomes the s-step exponential function.

3. Basic Results

When  s = 3 ,
AF 3 ( z ) = z 1 24 z 4 + 17 2520 z 7 389 259200 z 10 + 85897 222393600 z 13 887731 8211456000 z 16 + 762918737 23870702592000 z 19 16283723339 1658385653760000 z 22 + .
When  s = 4 ,
AF 4 ( z ) = z 1 120 z 5 + 25 72576 z 9 1655 83026944 z 13 + 32633 24320507904 z 17 4046837 41098797121536 z 21 + 95346434209 12477594806098329600 z 25 13496484991405 21884703082311982252032 z 29 + 7594510992880985 148224339331565182966038528 z 33 4010591254856244071 921362493285009177316895490048 z 37 + 116831353234301926949 310374651792009578002102307782656 z 41 .
In general, for the inverse function of  F s ( z ) , we have the following.
Proposition 1.
AF s ( z ) = d 0 z d 1 z s + 1 + d 2 z 2 s + 1 + ( 1 ) n d n z s n + 1 + ,
where the coefficients  d i  satisfy the recurrence relation
d n = m = 0 n 1 ( 1 ) n m 1 d m i 1 + + i s m + 1 = n m i 1 , , i s m + 1 0 1 ( s i 1 + 1 ) ! ( s i s m + 1 + 1 ) ! ( n 1 )
with  d 0 = 1 .
Proof. 
The expression can be obtained by the following process. First, put  F s 1 ( z ) : = AF s ( z )  as
F s 1 ( z ) = d 0 z d 1 z s + 1 + d 2 z 2 s + 1 + ( 1 ) n d n z s n + 1 + .
Then we can find  d 0 = 1 , d 1 , d 2 ,  as follows. For convenience, put
H s , n ( j ) : = i 1 + + i s n + 1 = j i 1 , , i s n + 1 0 1 ( s i 1 + 1 ) ! ( s i s n + 1 + 1 ) ! .
Since  F s 1 F s ( z ) = F s F s 1 ( z ) = z , we see that
z = n = 0 ( 1 ) n d n m = 0 z s m + 1 ( s m + 1 ) ! s n + 1 = n = 0 ( 1 ) n d n m = 0 H s , n ( m ) z s n + s m + 1 = n = 0 ( 1 ) n d n l = n H s , n ( l n ) z s l + 1 = n = 0 m = 0 n ( 1 ) m d m H s , m ( n m ) z s n + 1 .
Hence, for  n 1
m = 0 n ( 1 ) m d m H s , m ( n m ) = 0
with  d 0 = 1 . The exact values of  d 0 , d 1 , d 2 ,  can be obtained by the recurrence relation (2). Some values of  H s , n ( j )  for smaller j can be given as follows.
H s , n ( 0 ) = 1 , H s , n ( 1 ) = s n + 1 ( s + 1 ) ! , H s , n ( 2 ) = s n + 1 ( 2 s + 1 ) ! + 1 ( s + 1 ) ! 2 s n + 1 2 , H s , n ( 3 ) = s n + 1 ( 3 s + 1 ) ! + ( s n + 1 ) ( s n ) ( 2 s + 1 ) ! ( s + 1 ) ! + 1 ( s + 1 ) ! 3 s n + 1 3 , H s , n ( 4 ) = s n + 1 ( 4 s + 1 ) ! + ( s n + 1 ) ( s n ) ( 3 s + 1 ) ! ( s + 1 ) ! + 1 ( 2 s + 1 ) ! 2 s n + 1 2 + s n + 1 ( 2 s + 1 ) ! ( s + 1 ) ! 2 s n 2 + 1 ( s + 1 ) ! 4 s n + 1 4 .
Hence,
d 1 = H s , 0 ( 1 ) = 1 ( s + 1 ) ! , d 2 = H s , 0 ( 2 ) + d 1 H s , 1 ( 1 ) = 1 ( s + 1 ) ! r ! 1 ( 2 s + 1 ) ! , d 3 = H s , 0 ( 3 ) d 1 H s , 1 ( 2 ) + d 2 H s , 2 ( 1 ) = 3 r + 2 2 ( s + 1 ) ! 2 s ! 3 s + 2 ( 2 s + 1 ) ! ( s + 1 ) ! + 1 ( 3 s + 1 ) ! , d 4 = H s , 0 ( 4 ) + d 1 H s , 1 ( 3 ) d 2 H s , 2 ( 2 ) + d 3 H s , 3 ( 1 ) = ( 4 s + 3 ) ( 2 s + 1 ) 3 ( s + 1 ) ! 3 s ! + 1 ( 2 s + 1 ) ! ( 2 s ) ! 4 s + 3 ( 2 s ) ! ( s + 1 ) ! 2 + 2 ( 2 s + 1 ) ( 3 s + 1 ) ! ( s + 1 ) ! 1 ( 4 s + 1 ) ! ,
Thus, by the definition (1), explicit expressions of  C n , s ( k )  for each concrete s and small n can be achieved. For  s = 3 , we have
C 0 , 3 ( k ) = 1 , C 3 , 3 ( k ) = 1 4 k , C 6 , 3 ( k ) = 6 4 1 4 k + 1 7 k , C 9 , 3 ( k ) = 3 ( 35 · 1 + 79 ) 8 9 7 1 4 k 9 4 1 7 k + 1 10 k , C 12 , 3 ( k ) = 9 · 22 · 153 4 12 10 1 4 k + 3 ( 35 · 2 + 79 ) 8 12 7 1 7 k 12 4 1 10 k + 1 13 k .
For  s = 4 , since
AF 4 ( x ) 4 m ( 4 m ) ! = x 4 m ( 4 m ) ! 4 m + 4 5 x 4 m + 4 ( 4 m + 4 ) ! + 2 ( 126 m + 281 ) 5 4 m + 8 9 x 4 m + 8 ( 4 m + 8 ) ! 8 ( 6006 m 2 + 40183 m + 67157 ) 5 4 m + 12 13 x 4 m + 12 ( 4 m + 12 ) ! + 16 ( 12864852 m 3 + 172143972 m 2 + 767355367 m + 1139488217 ) 45 4 m + 16 17 x 4 m + 16 ( 4 m + 16 ) ! ,
we have
C 0 , 4 ( k ) = 1 , C 4 , 4 ( k ) = 1 5 k , C 8 , 4 ( k ) = 8 5 1 5 k + 1 9 k , C 12 , 4 ( k ) = 2 ( 126 · 1 + 281 ) 5 12 9 1 5 k 12 5 1 9 k + 1 13 k , C 16 , 4 ( k ) = 8 ( 6006 · 1 2 + 40183 · 1 + 67157 ) 5 16 13 1 5 k + 2 ( 126 · 2 + 281 ) 5 16 9 1 9 k 16 5 1 13 k + 1 17 k .

4. Iterated Integrals

Similarly to the cases of the poly-Cauchy numbers with levels 1 and 2 ([6,15]), Cauchy numbers with higher levels have an expression in terms of iterated integrals.
Since
d d z z Lif s , k ( z ) = Lif s , k 1 ( z ) ,
we have
d d z z Lif s , k ( z ) = d d z n = 0 z 3 n + 1 ( s n ) ! ( s n + 1 ) k = n = 0 z s n ( s n ) ! ( s n + 1 ) k 1 = Lif s , k 1 ( z ) .
Therefore,
Lif s , k 1 ( z ) = 1 z 0 z Lif s , k 1 ( z ) d z .
By iteration, we get
Lif s , k ( z ) = 1 z 0 z 1 z 0 z 1 z 0 z k 1 Lif s , 1 ( z ) d z d z k 1 .
Putting  z = AF s ( t ) , we get
Lif s , k ( AF s ( t ) ) = 1 AF s ( t ) 0 t G s ( t ) AF s ( t ) 0 t k 1 t G s ( t ) AF s ( t ) d t d t k 1 ,
where
G s ( z ) = d d z AF s ( z ) = n = 0 ( 1 ) n ( s n + 1 ) d n z s n = 1 1 s ! z s + 1 ( 2 s ) ! 2 s + 1 s 1 z 2 s 1 ( 3 s ) ! 1 2 3 s + 2 s + 1 , s + 1 , s 3 s + 2 s + 1 + 1 z 3 s + 1 ( 4 s ) ! 1 6 4 s + 3 s + 1 , s + 1 , s + 1 , s + 4 s + 1 2 s 1 2 4 s + 3 2 s + 1 , s + 1 , s + 1 + 4 s + 2 s + 1 1 z 4 s ,
where  n s 1 , , s m = n ! ( s 1 ) ! ( s m ) !  denotes the multinomial coefficient with  n = s 1 + + s m .
Moreover we can express the Laurent series of  G s ( t ) / AF s ( t ) , in fact,
G s ( t ) AF s ( t ) = AF s ( t ) AF s ( t )
with  AF s ( t ) = t D s ( t )  and  D s ( 0 ) 0 . Hence
G s ( t ) AF s ( t ) = D s ( t ) + t D s ( t ) t D s ( t ) = 1 t + D s ( t ) D s ( t ) = 1 t + d d t log D s ( t ) .
From (3), we have
D s ( t ) = d 0 d 1 t s + d 2 t 2 s d 3 t 3 s + = d 0 + u ( t ) ,
with  d 0 = 1  and  u ( t ) = d 1 t s + d 2 t 2 s d 3 t 3 s + . So,
log D s ( t ) = log ( 1 + u ( t ) ) = k = 1 ( 1 ) k 1 u ( t ) k k
Therefore,
log D s ( t ) = ( d 1 t s + d 2 t 2 s d 3 t 3 s + ) 1 2 ( d 1 t s + d 2 t 2 s d 3 t 3 s + ) 2 + + 1 3 ( d 1 t s + d 2 t 2 s d 3 t 3 s + ) 3 + .
So, it follows that
log D s ( t ) = d 1 t s + d 2 d 1 2 2 t 2 s + d 3 + d 1 d 2 d 1 3 3 t 3 s + d 4 d 1 d 3 d 2 2 2 + d 1 2 d 2 d 1 4 4 t 4 s + ,
yielding the expression
d d t log D s ( t ) = s d 1 t s 1 + 2 s d 2 d 1 2 2 t 2 s 1 + 3 s d 3 + d 1 d 2 d 1 3 3 t 3 s 1 + 4 s d 4 d 1 d 3 d 2 2 2 + d 1 2 d 2 d 1 4 4 t 4 s 1 + .
After substituting the vales of  d n , we have
G s ( t ) AF s ( t ) = 1 t s ( s + 1 ) ! t s 1 + 2 s 2 s + 1 2 ( s + 1 ) ! 2 1 ( 2 s + 1 ) ! t 2 s 1 + 3 s 3 s + 1 ( 2 s + 1 ) ! ( s + 1 ) ! ( 3 s + 2 ) ( 3 s + 1 ) 6 ( s + 1 ) ! 3 1 ( 3 s + 1 ) ! t 3 s 1 + 4 s 4 s + 1 ( 3 s + 1 ) ! ( s + 1 ) ! 4 s + 1 ( 2 s ) ! ( s + 1 ) ! 2 + 4 s + 1 2 ( 2 s + 1 ) ! 2 + ( 4 s + 3 ) ( 4 s + 1 ) ( 2 s + 1 ) 12 ( s + 1 ) ! 4 1 ( 4 s + 1 ) ! t 4 s 1 + .
Proposition 2.
We have
n = 0 C n , s ( k ) t n n ! = 1 AF s ( t ) 0 t G s ( t ) AF s ( t ) 0 t k 1 t G s ( t ) AF s ( t ) d t d t k 1 ,
where  G s ( z ) = d d z AF s ( z )  and a more precise expression of  G s ( t ) / AF s ( t )  is given in (5).

5. An Explicit Expression

If we know the coefficients  d n  ( n 0 ) appeared in  AF s ( t )  in Proposition 1, we can get an expression of  C n , s ( k ) .
Theorem 1.
For integers n and k with  n 0 ,
C s n , s ( k ) = m = 0 n ( 1 ) n m ( s n ) ! ( s m ) ! ( s m + 1 ) k i 1 + + i s m = n m i 1 , , i s m 0 d i 1 d i s m t s n .
Proof. 
By the definition in (1), we have
n = 0 C n , s ( k ) t n n ! = n = 0 C s n , s ( k ) t s n ( s n ) ! = m = 0 1 ( s m ) ! ( s m + 1 ) k l = 0 ( 1 ) l d l t s l + 1 s m = m = 0 1 ( s m ) ! ( s m + 1 ) k × n = m i 1 + + i s m = n m i 1 , , i s m 0 ( 1 ) i 1 + + i s m d i 1 d i s m t ( s i 1 + 1 ) + + ( s i s m + 1 ) = n = 0 m = 0 n 1 ( s m ) ! ( s m + 1 ) k i 1 + + i s m = n m i 1 , , i s m 0 ( 1 ) n m d i 1 d i s m t s n .
Comparing the coefficients on both sides, we get the desired result. □

6. Some Expressions of Poly-Cauchy Numbers with Higher Levels for Negative Indices

The poly-Bernoulli numbers  B n ( k )  [8], defined by
Li k ( 1 e t ) 1 e t = n = 0 B n ( k ) t n n ! ,
where
Li k ( z ) = n = 1 z n n k
is the polylogarithm function, satisfy the duality formula  B n ( k ) = B k ( n )  for  n , k > 0 , because of the symmetric formula
n = 0 k = 0 B n ( k ) x n n ! y k k ! = e x + y e x + e y e x + y .
Though the corresponding duality formula does not hold for the original poly-Cauchy numbers (ref. [16], Proposition 1) and poly-Cauchy numbers with level 2 (ref. [6], Theorem 4.1), we still have the double summation formula of poly-Cauchy numbers with higher level.
Theorem 2.
For nonnegative integers n and k,
n = 0 k = 0 C s n , s ( s k ) x s n ( s n ) ! y s k ( s k ) ! = 1 s 2 j = 0 s 1 h = 0 s 1 e ζ j y BF s ( x ) ζ h e ζ j y ,
where  BF s ( x ) = e AF s ( x )  and ζ is the s-th root of unity as  ζ = e 2 π i / s = cos ( 2 π / s ) + i sin ( 2 π / s ) .
Proof. 
From the definition in (1), we have
n = 0 k = 0 C s n , s ( s k ) x s n ( s n ) ! y s k ( s k ) ! = k = 0 Lif s , k AF s ( x ) y s k ( s k ) ! = k = 0 m = 0 AF s ( x ) s m ( s m ) ! ( s m + 1 ) s k y s k ( s k ) ! = m = 0 AF s ( x ) s m ( s m ) ! 1 s j = 0 s 1 e ζ j ( s m + 1 ) y = 1 s j = 0 s 1 e ζ j y m = 0 e ζ j y AF s ( x ) ( s m ) ! = 1 s 2 j = 0 s 1 h = 0 s 1 e ζ j y e ζ h e ζ j y AF s ( x ) ,
yielding the desired result. □

7. Cauchy Numbers with Higher Level

When  k = 1  in (1),  C n , s = C n , s ( 1 )  are the Cauchy numbers with higher level, defined by
t AF s ( t ) = n = 0 C n , s t n n ! .
In this section, we shall show some properties of  C n , s = C n , s ( 1 ) . First, we give its determinant expression. A similar expression for the hypergeometric Cauchy numbers is given in [18].
Theorem 3.
For  n 1 ,
C s n , s = ( s n ) ! d 1 1 0 d 2 d 1 1 0 d 1 1 d n d 2 d 1 ,
where  d n  is the coefficient of  t s n + 1  appeared in  AF s ( t )  in Proposition 1.
Remark 1.
By using the values of d’s in (4), Theorem 3 yields
C 0 , s = 1 , C s , s = 1 s + 1 , C 2 s , s = 1 2 s + 1 s ( 2 s ) ! ( s + 1 ) ! 2 , C 3 s , s = 1 3 s + 1 3 s ( 3 s ) ! ( 2 s + 1 ) ! ( s + 1 ) ! + s ( 3 s + 1 ) ! 2 ( s + 1 ) ! 3 , C 4 s , s = 1 4 s + 1 4 s ( 4 s ) ! ( 3 s + 1 ) ! ( s + 1 ) ! ( 8 s + 3 ) ( 4 s ) ! ( 2 s + 1 ) ! ( s + 1 ) ! 2 2 s ( 4 s ) ! ( 2 s + 1 ) ! ( s + 1 ) ! 2 + ( 4 s + 3 ) ( 4 s ) ! ( 2 s ) ! s + 1 ) ! 2 s ( 8 s 2 + 6 s + 1 ) ( 4 s ) ! ( s + 1 ) ! 4 , .
Proof of Theorem 3.
From (6), we have
1 = m = 0 C s m , s t s m ( s m ) ! l = 0 ( 1 ) l d l t s l = n = 0 l = 0 n C s n s l , s ( s n s l ) ! ( 1 ) l d l t s n .
where the coefficients  d 0 , d 1 ,  are also given in (3) with (4). Comparing the coefficients on both sides,
l = 0 n C s n s l , s ( s n s l ) ! ( 1 ) l d l = 0 ( n 1 ) .
By the inversion relation
k = 0 n ( 1 ) n k α k R ( n k ) = 0 ( n 1 ) w i t h α 0 = R ( 0 ) = 1 α n = R ( 1 ) 1 0 R ( 2 ) 1 R ( n ) R ( 2 ) R ( 1 ) R ( n ) = α 1 1 0 α 2 1 α n α 2 α 1
(e.g., see [19]), we get the result as
α n = d n and R ( n ) = C s n , s ( s n ) ! .
By the inversion formula shown in the above proof, we also have the following Corollary. Similar determinant expressions of Bernoulli, Cauchy and related numbers were found in [20]).
Corollary 1.
For  n 1 ,
d n = C s , s s ! 1 0 C 2 s , s ( 2 s ) ! C 3 s , s ( 3 s ) ! 1 C s n , s ( s n ) ! C 2 s , s ( 2 s ) ! C s , s s ! .
By Trudi’s formula
a 1 a 2 a m a 0 a 1 a 1 a 2 0 a 0 a 1 = t 1 + 2 t 2 + + m t m = m t 1 + + t m t 1 , , t m ( a 0 ) m t 1 t m a 1 t 1 a 2 t 2 a m t m
(refs. [21,22]; ref. [23], Volume 3, pp. 208–209, p. 214), we have a different expression of  C n , s .
Theorem 4.
C s n , s = ( s n ) ! t 1 + 2 t 2 + + n t n = n t 1 + + t n t 1 , , t n ( 1 ) n t 1 t n ( d 1 ) t 1 ( d 2 ) t 2 ( d n ) t n
and
d n = t 1 + 2 t 2 + + n t n = n t 1 + + t n t 1 , , t n ( 1 ) n t 1 t n × C s , s s ! t 1 C 2 s , s ( 2 s ) ! t 2 C s n , s ( s n ) ! t n .

8. A Recurrence Relation for  C n , s ( k )  in Terms of  C n , s

We can show a recurrence formula for  C n , s ( k )  in terms of  C n , s ( k 1 )  and  C n , s .
Theorem 5.
For integers n and k with  n 0  and  k 1 ,
C s n , s ( k ) = ( s n ) ! ν = 0 n m = 0 ν ( 1 ) ν m ( s ν s m + 1 ) d ν m C s n s ν , s C s m , s ( k 1 ) ( s n s ν ) ! ( s m ) ! ( s ν + 1 ) ,
where  d n  is the coefficient of  t s n + 1  appeared in  AF s ( t )  in Proposition 1.
Remark 2.
Poly-Cauchy numbers  c n ( k )  have a recurrence formula (ref. [16], Theorem 7)
c n ( k ) = n ! ν = 0 n m = 0 ν ( 1 ) ν m c n ν c m ( k 1 ) ( n ν ) ! m ! ( ν + 1 ) .
Poly-Cauchy numbers  C n ( k )  with level 2 have a recurrence formula (ref. [6], Theorem 3.4)
C 2 n ( k ) = ( 2 n ) ! ν = 0 n m = 0 ν 1 4 ν m 2 ν 2 m ν m C 2 n 2 ν C 2 m ( k 1 ) ( 2 n 2 ν ) ! ( 2 m ) ! ( 2 ν + 1 ) .
Proof of Theorem 5.
Similarly to the description in Section 4, we obtain
n = 0 C s n , s ( k ) x s n ( s n ) ! = Lif s , k AF s ( x ) = 1 AF s ( x ) 0 x Lif s , k 1 AF s ( σ ) G s ( σ ) d σ = n = 0 C s n , s x s n 1 ( s n ) ! 0 x m = 0 C s m , s ( k 1 ) σ s m ( s m ) ! j = 0 ( 1 ) j ( s j + 1 ) d j σ r j d σ = n = 0 C s n , s x s n 1 ( s n ) ! 0 x ν = 0 m = 0 ν ( 1 ) ν m ( s ν s m + 1 ) d ν m C s m , s ( k 1 ) ( s m ) ! σ s ν d σ = n = 0 C s n , s x s n 1 ( s n ) ! ν = 0 m = 0 ν ( 1 ) ν m ( s ν s m + 1 ) d ν m C s m , s ( k 1 ) ( s m ) ! x s ν + 1 s ν + 1 = n = 0 ν = 0 n m = 0 ν ( 1 ) ν m ( s ν s m + 1 ) d ν m C s n s ν , s C s m , s ( k 1 ) ( s n s ν ) ! ( s m ) ! ( s ν + 1 ) x s n .
Comparing the coefficients on both sides, we get the result. □

9. Conclusions

In this paper, we define poly-Cauchy numbers with higher level (level s) from the analytical implications, and study their properties. Such poly-Cauchy numbers with higher levels are yielded from the inverse relationship with an s-step function of the exponential function. When  s 3 , the inverse function is not given using a known function, but it can be used to obtain the expressions and relations.
Poly-Bernoulli numbers with level 2 are defined and studied in [7]. Is it possible to introduce poly-Bernoulli numbers with higher levels? If so, is there any relation between them and poly-Cauchy numbers with higher levels?

Author Contributions

Writing—original draft preparation, T.K.; writing—review and editing, V.F.S. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Not applicable.

Acknowledgments

The authors thank the anonymous referees for careful reading of this manuscript.

Conflicts of Interest

The author declares no conflict of interest.

References

  1. Tweedie, C. The Stirling numbers and polynomials. Proc. Edinb. Math. Soc. 1918, 37, 2–25. [Google Scholar] [CrossRef] [Green Version]
  2. Butzer, P.L.; Schmidt, M.; Stark, E.L.; Vogt, L. Central factorial numbers; their main properties and some applications. Numer. Funct. Anal. Optim. 1989, 10, 419–488. [Google Scholar] [CrossRef]
  3. Bell, E.T. Lagrange and Wilson theorems for the generalized Stirling numbers. Proc. Edinb. Math. Soc. 1938, 5, 171–173. [Google Scholar] [CrossRef] [Green Version]
  4. Komatsu, T.; Ramírez, J.L.; Villamizar, D. A combinatorial approach to the Stirling numbers of the first kind with higher level. Stud. Sci. Math. Hung. 2021, 58, 293–307. [Google Scholar] [CrossRef]
  5. Komatsu, T.; Ramírez, J.L.; Villamizar, D. A combinatorial approach to the generalized central factorial numbers. Mediterr. J. Math. 2021, 18, 192. [Google Scholar] [CrossRef]
  6. Komatsu, T.; Pita-Ruiz, C. Poly-Cauchy numbers with level 2. Integral Transform. Spec. Funct. 2020, 317, 570–585. [Google Scholar] [CrossRef]
  7. Komatsu, T. Stirling numbers with level 2 and poly-Bernoulli numbers with level 2. Publ. Math. Debr. 2022, 100, 241–256. [Google Scholar] [CrossRef]
  8. Kaneko, M. Poly-Bernoulli numbers. J. Théor. Nombres Bordx. 1997, 9, 199–206. [Google Scholar] [CrossRef]
  9. Kaneko, M.; Pallenwatta, M.; Tsumura, H. On polycosecant numbers. arXiv 2019, arXiv:1907.13441. [Google Scholar]
  10. Kaneko, M.; Tsumura, H. On multiple zeta values of level two. Tsukuba J. Math. 2020, 44, 213–234. [Google Scholar] [CrossRef]
  11. Broder, A.Z. The r-Stirling numbers. Discret. Math. 1984, 49, 241–259. [Google Scholar] [CrossRef] [Green Version]
  12. Kargin, L. On Cauchy numbers and their generalizations. Gazi Univ. J. Sci. 2020, 33, 456–474. [Google Scholar] [CrossRef]
  13. Kargin, L.; Cenkci, M.; Dil, A.; Can, M. Generalized harmonic numbers via poly-Bernoulli polynomials. Publ. Math. Debr. 2022, 100, 365–386. [Google Scholar] [CrossRef]
  14. Kargin, L.; Can, M. Harmonic number identities via polynomials with r-Lah coefficients. Comptes Rendus Mathématique 2020, 358, 535–550. [Google Scholar] [CrossRef]
  15. Komatsu, T. Poly-Cauchy numbers. Kyushu J. Math. 2013, 67, 143–153. [Google Scholar] [CrossRef] [Green Version]
  16. Komatsu, T. Poly-Cauchy numbers with a q parameter. Ramanujan J. 2013, 31, 353–371. [Google Scholar] [CrossRef]
  17. Lehmer, D.H. Lacunary recurrence formulas for the numbers of Bernoulli and Euler. Ann. Math. 1935, 36, 637–649. [Google Scholar] [CrossRef]
  18. Aoki, M.; Komatsu, T. Remarks on hypergeometric Cauchy numbers. Math. Rep. 2020, 22, 363–380. [Google Scholar]
  19. Komatsu, T.; Ramirez, J.L. Some determinants involving incomplete Fubini numbers. An. Ştiinţ. Univ. “Ovidius” Constanţa Ser. Mat. 2018, 26, 143–170. [Google Scholar] [CrossRef] [Green Version]
  20. Glaisher, J.W.L. Expressions for Laplace’s coefficients, Bernoullian and Eulerian numbers etc. as determinants. Messenger 1875, 6, 49–63. [Google Scholar]
  21. Brioschi, F. Sulle funzioni Bernoulliane ed Euleriane. Ann. di Mat. Pura ed Appl. 1858, 1, 260–263. [Google Scholar] [CrossRef]
  22. Trudi, N. Intorno ad Alcune Formole di Sviluppo, Rendic; dell’ Accad: Napoli, Italy, 1862; pp. 135–143. [Google Scholar]
  23. Muir, T. The Theory of Determinants in the Historical Order of Development; Four Volumes; Dover Publications: New York, NY, USA, 1960. [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

Komatsu, T.; Sirvent, V.F. Poly-Cauchy Numbers with Higher Level. Symmetry 2023, 15, 354. https://doi.org/10.3390/sym15020354

AMA Style

Komatsu T, Sirvent VF. Poly-Cauchy Numbers with Higher Level. Symmetry. 2023; 15(2):354. https://doi.org/10.3390/sym15020354

Chicago/Turabian Style

Komatsu, Takao, and Víctor F. Sirvent. 2023. "Poly-Cauchy Numbers with Higher Level" Symmetry 15, no. 2: 354. https://doi.org/10.3390/sym15020354

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