DOCSLIB.ORG

Degenerate Stirling Polynomials of the Second Kind and Some Applications

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Degenerate Stirling Polynomials of the Second Kind and Some Applications S S symmetry Article Degenerate Stirling Polynomials of the Second Kind and Some Applications Taekyun Kim 1,*, Dae San Kim 2,*, Han Young Kim 1 and Jongkyum Kwon 3,* 1 Department of Mathematics, Kwangwoon University, Seoul 139-701, Korea 2 Department of Mathematics, Sogang University, Seoul 121-742, Korea 3 Department of Mathematics Education and ERI, Gyeongsang National University, Jinju 52828, Korea * Correspondence: [email protected] (T.K.); [email protected] (D.S.K.); [email protected] (J.K.) Received: 20 July 2019; Accepted: 13 August 2019; Published: 14 August 2019 Abstract: Recently, the degenerate l-Stirling polynomials of the second kind were introduced and investigated for their properties and relations. In this paper, we continue to study the degenerate l-Stirling polynomials as well as the r-truncated degenerate l-Stirling polynomials of the second kind which are derived from generating functions and Newton’s formula. We derive recurrence relations and various expressions for them. Regarding applications, we show that both the degenerate l-Stirling polynomials of the second and the r-truncated degenerate l-Stirling polynomials of the second kind appear in the expressions of the probability distributions of appropriate random variables. Keywords: degenerate l-Stirling polynomials of the second kind; r-truncated degenerate l-Stirling polynomials of the second kind; probability distribution 1. Introduction For n ≥ 0, the Stirling numbers of the second kind are defined as (see [1–26]) n n x = ∑ S2(n, k)(x)k, (1) k=0 where (x)0 = 1, (x)n = x(x − 1) ··· (x − n + 1), (n ≥ 1). From (1), we note that the generating function for S2(n, k) is given by (see [8,9,23,26]) ¥ n 1 t k t (e − 1) = ∑ S2(n, k) , (k ≥ 0). (2) k! n=k n! For l 2 R, the degenerate exponential function is defined by (see [10,11,27,28]) x 1 x l 1 l el(t) = (1 + lt) , el(t) = el(t) = (1 + lt) . (3) In view of (2), the degenerate l-Stirling polynomials of the second kind are defined by the generating function 1 ¥ tn ( ( ) − )k x ( ) = (x)( ) el t 1 el t ∑ S2,l n, k , (4) k! n=k n! where x 2 R and k is a nonnegative integer, (see [10,11]). (0) When x = 0, S2,l(n, k) = S2,l(n, k) are called the degenerate l-Stirling numbers of the second kind. Note that liml!0 S2,l(n, k) = S2(n, k), (n, k ≥ 0). Symmetry 2019, 11, 1046; doi:10.3390/sym11081046 www.mdpi.com/journal/symmetry Symmetry 2019, 11, 1046 2 of 11 By letting l ! 0 in (4), we have the generating function for the Stirling polynomials of the second (x) kind S2 (n, k) (see [11,13,14,22]): ¥ n 1 t k xt (x) t (e − 1) e = ∑ S2 (n, k) . (5) k! n=k n! Let X be a discrete random variable with probability mass function P[X = x] = p(x). Then, the probability generating function of X is given by (see [4,17,18,20,22]) ¥ G(t) = E[tX] = ∑ tx p(x). (6) x=0 Suppose that X = (X1, X2, ··· , Xk) is a discrete random variable taking values in the k-dimensional nonnegative integer lattice. Then, the probability generating function of X is defined as (see [4]) X1 X2 Xk G(t) = G(t1, t2, ··· , tk) = E[t1 t2 ··· tk ] ¥ (7) = x1 x2 ··· xk ( ··· ) ∑ t1 t2 tk p x1, x2, xk , x1,x2,··· ,xk=0 where p(x1, x2, ··· xk) is the probability mass function of X = (X1, X2, ··· , Xk). X is the random variable with the zero-truncated Poisson distribution with parameter l if the probability mass function of X is (see [4,17,18,20,22]) 1 lx P[X = x] = p(x) = e−l , (8) 1 − e−l x! where x is a positive integer. For r 2 N, X is the random variable with r-truncated Poisson distribution with parameter l if the probability mass function of X is lx P[X = x] = p(x) = C(l, r)e−l , (9) x! −l r−1 lx −1 where C(l, r) = (1 − e ∑x=0 x! ) . In this paper, we study the degenerate l-Stirling polynomials, as a continuation of the previous work in [10], and also the r-truncated degenerate l-Stirling polynomials of the second kind which are derived from generating functions and Newton’s formula. We derive recurrence relations and various expressions for them. As applications, we show that both the degenerate l-Stirling polynomials of the second kind and the r-truncated degenerate l-Stirling polynomials of the second kind appear in the expressions of the probability distributions of appropriate random variables. 2. The Degenerate l-Stirling Polynomials of the Second Kind Let x, t be real numbers and let n be a nonnegative integer. The difference operator 4 is defined by 4 f (x) = f (x + 1) − f (x). It is easy to show that n n (I + 4)n f (0) = f (n) = ∑ 4k f (0). (10) k=0 k From (10), we can derive Newton’s formula which is given by ¥ t f (t) = ∑ 4k f (0). (11) k=0 k Symmetry 2019, 11, 1046 3 of 11 Let us take f (t) = (t + x)n,l, (n ≥ 0). Then, by (11), we get ¥ t k (t + x)n,l = ∑ 4 (t + x)n,l k=0 k t=0 n t k = ∑ 4 (t + x)n,l (12) k=0 k t=0 n 1 k = ∑ 4 (t + x)n,l (t)k. k=0 k! t=0 Here, the generalized factorial sequence (x)n,l is given by (x)0,l = 1, (x)n,l = x(x − l) ··· (x − (n − 1)l), (n ≥ 1). (13) Let (x) 1 k 1 k S2,l (n, k) = 4 (t + x)n,l = 4 (x)n,l, (n, k ≥ 0). (14) k! t=0 k! Then, by (12) and (14), we get n ( + ) = (x)( )( ) ( ≥ ) t x n,l ∑ S2,l n, k t k, n 0 . (15) k=0 (x) In (18) below, we show that the S2,l (n, k) in (14) or (15) is really the degenerate l-Stirling polynomials of the second kind defined in (4). Using (13), (15), and interchanging the order of summations, we note that ¥ tn ¥ n tn x+y( ) = ( + ) = (x)( )( ) el t ∑ x y n,l ∑ ∑ S2,l n, k y k n=0 n! n=0 k=0 n! (16) ¥ ¥ tn = (x)( ) ( ) ∑ ∑ S2,l n, k y k. k=0 n=k n! On the other hand, ¥ + 1 x y( ) = x ( )( ( ) − + )y = ( ( ) − )k x ( )( ) el t el t el t 1 1 ∑ el t 1 el t y k. (17) k=0 k! By (16) and (17), we get 1 ¥ tn ( ( ) − )k x ( ) = (x)( ) ( ≥ ) el t 1 el t ∑ S2,l n, k , k 0 . (18) k! n=k n! Thus, we have shown that the definition of the degenerate l-Stirling polynomials of the second kind can be given as (14) or equivalently (15) or equivalently (18). Note that (x) (x) (x) S2,l (0, 0) = 1, S2,l (n, 0) = (x)n,l, S2,l (0, k) = 0, (k 6= 0). (19) Symmetry 2019, 11, 1046 4 of 11 We would like to derive a recurrence relation for the degenerate l-Stirling polynomials of the second kind. Now, we observe that n+1 (x)( + )( ) = ( + ) = ( + ) ( + − ) ∑ S2,l n 1, k t k t x n+1,l t x n,l t x nl k=0 n n = (x)( )( ) + ( − ) (x)( )( ) t ∑ S2,l n, k t k x nl ∑ S2,l n, k t k k=0 k=0 n+1 n = (x)( − )( ) + ( − ) (x)( )( ) t ∑ S2,l n, k 1 t k−1 x nl ∑ S2,l n, k t k k=1 k=0 (20) n+1 n = ( − + + − ) (x)( − )( ) + ( − ) (x)( )( ) ∑ t k 1 k 1 S2,l n, k 1 t k−1 x nl ∑ S2,l n, k t k k=1 k=0 n+1 n n = (x)( )( ) + (x)( )( ) + ( − ) (x)( )( ) ∑ S2,l n, k t k ∑ kS2,l n, k t k x nl ∑ S2,l n, k t k k=1 k=0 k=0 n+1 = (x)( − ) + ( + − ) (x)( ) ( ) ∑ S2,l n, k 1 k x nl S2,l n, k t k. k=0 Therefore, by comparing the coefficients on both sides of (20), we obtain the following theorem. Theorem 1. Let n, k be nonnegative integers. Then, we have (x) (x) (x) S2,l (n + 1, k) = S2,l (n, k − 1) + (k + x − nl)S2,l (n, k), (n ≥ k − 1). Note that (x) (x) S2,l (n, k) = 0, if k > n, S2,l (n, n) = 1. From (14), we have ( ) 1 S 0 (n, k) = 4k(0) = S (n, k), (n, k ≥ 0). (21) 2,l k! n,l 2,l Here, we want to derive an explicit expression for the degenerate l-Stirling polynomials of the second kind. By (18), we get ¥ tn 1 (x)( ) = x ( )( ( ) − )k ∑ S2,l n, k el t el t 1 n=k n! k! ¥ ¥ ( ) ( ) ··· ( ) 1 (x)m,l m 1 l1,l 1 l2,l 1 lk,l l = ∑ t ∑ ∑ t (22) k! m! l1!l2! ··· lk! m=0 l=k l1+···+lk=l ¥ n n n! (x) − (1)l ,l(1)l ,l ··· (1)l ,l t = ∑ ∑ n l,l ∑ 1 2 k , k! (n − l)! l1!l2! ··· lk! n! n=k l=k l1+···+lk=l where all lj’s are positive integers.
Load more

Recommended publications
  • On Moment Sequences and Mixed Poisson Distributions
    ON MOMENT SEQUENCES AND MIXED POISSON DISTRIBUTIONS MARKUS KUBA AND ALOIS PANHOLZER Abstract. In this article we survey properties of mixed Poisson dis- tributions and probabilistic aspects of the Stirling transform: given a non-negative random variable X with moment sequence (µs)s∈N we de- termine a discrete random variable Y , whose moment sequence is given by the Stirling transform of the sequence (µs)s∈N, and identify the dis- tribution as a mixed Poisson distribution. We discuss properties of this family of distributions and present a simple limit theorem based on ex- pansions of factorial moments instead of power moments. Moreover, we present several examples of mixed Poisson distributions in the analysis of random discrete structures, unifying and extending earlier results. We also add several entirely new results: we analyse triangular urn mod- els, where the initial configuration or the dimension of the urn is not fixed, but may depend on the discrete time n. We discuss the branch- ing structure of plane recursive trees and its relation to table sizes in the Chinese restaurant process. Furthermore, we discuss root isolation procedures in Cayley-trees, a parameter in parking functions, zero con- tacts in lattice paths consisting of bridges, and a parameter related to cyclic points and trees in graphs of random mappings, all leading to mixed Poisson-Rayleigh distributions. Finally, we indicate how mixed Poisson distributions naturally arise in the critical composition scheme of Analytic Combinatorics. 1. Introduction In combinatorics the Stirling transform of a given sequence (as)s∈N, see [12, 75], is the sequence (bs)s∈N, with elements given by ( ) s s b = X a , s ≥ 1.
    [Show full text]
  • Arxiv:1311.5067V5 [Math.CO] 27 Jan 2021 and Φ Eso H Rtadscn Id Ohplnma Aiisapa As Appear Su Families Order
    Multivariate Stirling Polynomials of the First and Second Kind Alfred Schreiber Department of Mathematics and Mathematical Education, University of Flensburg, Auf dem Campus 1, D-24943 Flensburg, Germany Abstract Two doubly indexed families of homogeneous and isobaric polynomials in several indeterminates are considered: the (partial) exponential Bell polyno- −(2n−1) mials Bn,k and a new family Sn,k ∈ Z[X1, . ,Xn−k+1] such that X1 Sn,k and Bn,k obey an inversion law which generalizes that of the Stirling num- bers of the first and second kind. Both polynomial families appear as Lie coefficients in expansions of certain derivatives of higher order. Substituting Dj(ϕ) (the j-th derivative of a fixed function ϕ) in place of the indeterminates Xj shows that both Sn,k and Bn,k are differential polynomials depending on ϕ and on its inverse ϕ, respectively. Some new light is shed thereby on Comtet’s solution of the Lagrange inversion problem in terms of the Bell polynomials. According to Haiman and Schmitt that solution is essentially the antipode on the Fa`adi Bruno Hopf algebra. It can be represented by −(2n−1) X1 Sn,1. Moreover, a general expansion formula that holds for the whole family Sn,k (1 ≤ k ≤ n) is established together with a closed expression for the coefficients of Sn,k. Several important properties of the Stirling numbers are demonstrated to be special cases of relations between the corresponding arXiv:1311.5067v5 [math.CO] 27 Jan 2021 polynomials. As a non-trivial example, a Schl¨omilch-type formula is derived expressing Sn,k in terms of the Bell polynomials Bn,k, and vice versa.
    [Show full text]
  • An Identity for Generalized Bernoulli Polynomials
    1 2 Journal of Integer Sequences, Vol. 23 (2020), 3 Article 20.11.2 47 6 23 11 An Identity for Generalized Bernoulli Polynomials Redha Chellal1 and Farid Bencherif LA3C, Faculty of Mathematics USTHB Algiers Algeria [email protected] [email protected] [email protected] Mohamed Mehbali Centre for Research Informed Teaching London South Bank University London United Kingdom [email protected] Abstract Recognizing the great importance of Bernoulli numbers and Bernoulli polynomials in various branches of mathematics, the present paper develops two results dealing with these objects. The first one proposes an identity for the generalized Bernoulli poly- nomials, which leads to further generalizations for several relations involving classical Bernoulli numbers and Bernoulli polynomials. In particular, it generalizes a recent identity suggested by Gessel. The second result allows the deduction of similar identi- ties for Fibonacci, Lucas, and Chebyshev polynomials, as well as for generalized Euler polynomials, Genocchi polynomials, and generalized numbers of Stirling. 1Corresponding author. 1 1 Introduction Let N and C denote, respectively, the set of positive integers and the set of complex numbers. (α) In his book, Roman [41, p. 93] defined generalized Bernoulli polynomials Bn (x) as follows: for all n ∈ N and α ∈ C, we have ∞ tn t α B(α)(x) = etx. (1) n n! et − 1 Xn=0 The Bernoulli numbers Bn, classical Bernoulli polynomials Bn(x), and generalized Bernoulli (α) numbers Bn are, respectively, defined by (1) (α) (α) Bn = Bn(0), Bn(x)= Bn (x), and Bn = Bn (0). (2) The Bernoulli numbers and the Bernoulli polynomials play a fundamental role in various branches of mathematics, such as combinatorics, number theory, mathematical analysis, and topology.
    [Show full text]
  • Asymptotic Estimates of Stirling Numbers
    Asymptotic Estimates of Stirling Numbers By N. M. Temme New asymptotic estimates are given of the Stirling numbers s~mJ and (S)~ml, of first and second kind, respectively, as n tends to infinity. The approxima­ tions are uniformly valid with respect to the second parameter m. 1. Introduction The Stirling numbers of the first and second kind, denoted by s~ml and (S~~m>, respectively, are defined through the generating functions n x(x-l)···(x-n+l) = [. S~m)Xm, ( 1.1) m= 0 n L @~mlx(x -1) ··· (x - m + 1), ( 1.2) m= 0 where the left-hand side of (1.1) has the value 1 if n = 0; similarly, for the factors in the right-hand side of (1.2) if m = 0. This gives the 'boundary values' Furthermore, it is convenient to agree on s~ml = @~ml= 0 if m > n. The Stirling numbers are integers; apart from the above mentioned zero values, the numbers of the second kind are positive; those of the first kind have the sign of ( - l)n + m. Address for correspondence: Professor N. M. Temme, CWI, P.O. Box 4079, 1009 AB Amsterdam, The Netherlands. e-mail: [email protected]. STUDIES IN APPLIED MATHEMATICS 89:233-243 (1993) 233 Copyright © 1993 by the Massachusetts Institute of Technology Published by Elsevier Science Publishing Co., Inc. 0022-2526 /93 /$6.00 234 N. M. Temme Alternative generating functions are [ln(x+1)r :x n " s(ln)~ ( 1.3) m! £..,, n n!' n=m ( 1.4) The Stirling numbers play an important role in difference calculus, combina­ torics, and probability theory.
    [Show full text]
  • A Unified Approach to Generalized Stirling Numbers
    ADVANCES IN APPLIED MATHEMATICS 20, 366]384Ž. 1998 ARTICLE NO. AM980586 A Unified Approach to Generalized Stirling Numbers Leetsch C. Hsu Institute of Mathematics, Dalian Uni¨ersity of Technology, Dalian 116024, China View metadata, citation and similar papers at core.ac.ukand brought to you by CORE provided by Elsevier - Publisher Connector Peter Jau-Shyong Shiue Department of Mathematical Sciences, Uni¨ersity of Ne¨ada, Las Vegas, Las Vegas, Ne¨ada 89154-4020 Received January 1, 1995; accepted January 3, 1998 It is shown that various well-known generalizations of Stirling numbers of the first and second kinds can be unified by starting with transformations between generalized factorials involving three arbitrary parameters. Previous extensions of Stirling numbers due to Riordan, Carlitz, Howard, Charalambides-Koutras, Gould-Hopper, Tsylova, and others are included as particular cases of our unified treatment. We have also investigated some basic properties related to our general pattern. Q 1998 Academic Press 1. INTRODUCTION As may be observed, a natural approach to generalizing Stirling numbers is to define Stirling number pairs as connection coefficients of linear transformations between generalized factorials. Of course, any useful generalization should directly imply some interesting special cases that have certain applications. The whole approach adopted in this paper is entirely different from that of Hsu and Yuwx 13 , starting with generating functions, and various new results are provided by a unified treatment. A recent paperwx 24 of TheoretÂÃ investigated some generating functions for the solutions of a type of linear partial difference equation with first-degree polynomial coefficients. Theoretically, it also provides a way of 366 0196-8858r98 $25.00 Copyright Q 1998 by Academic Press All rights of reproduction in any form reserved.
    [Show full text]
  • Expression and Computation of Generalized Stirling Numbers
    Expression and Computation of Generalized Stirling Numbers Tian-Xiao He Department of Mathematics and Computer Science Illinois Wesleyan University Bloomington, IL 61702-2900, USA August 2, 2012 Abstract Here presented is a unified expression of Stirling numbers and their generalizations by using generalized factorial functions and general- ized divided difference. Three algorithms for calculating the Stirling numbers and their generalizations based on our unified form are also given, which include a comprehensive algorithm using the character- ization of Riordan arrays. AMS Subject Classification: 05A15, 65B10, 33C45, 39A70, 41A80. Key Words and Phrases: Stirling numbers of the first kind, Stir- ling numbers of the second kind, factorial polynomials, generalized factorial, divided difference, k-Gamma functions, Pochhammer sym- bol and k-Pochhammer symbol. 1 Introduction The classical Stirling numbers of the first kind and the second kind, denoted by s(n; k) and S(n; k), respectively, can be defined via a pair of inverse relations n n X k n X [z]n = s(n; k)z ; z = S(n; k)[z]k; (1.1) k=0 k=0 with the convention s(n; 0) = S(n; 0) = δn;0, the Kronecker symbol, where z 2 C, n 2 N0 = N [ f0g, and the falling factorial polynomials [z]n = 1 2 T. X. He z(z − 1) ··· (z − n + 1). js(n; k)j presents the number of permutations of n elements with k disjoint cycles while S(n; k) gives the number of ways to partition n elements into k nonempty subsets. The simplest way to compute s(n; k) is finding the coefficients of the expansion of [z]n.
    [Show full text]
  • A Generalization of Stirling Numbers of the Second Kind Via a Special Multiset
    1 2 Journal of Integer Sequences, Vol. 13 (2010), 3 Article 10.2.5 47 6 23 11 A Generalization of Stirling Numbers of the Second Kind via a Special Multiset Martin Griffiths School of Education (Mathematics) University of Manchester Manchester M13 9PL United Kingdom [email protected] Istv´an Mez˝o Department of Applied Mathematics and Probability Theory Faculty of Informatics University of Debrecen H-4010 Debrecen P. O. Box 12 Hungary [email protected] Abstract Stirling numbers of the second kind and Bell numbers are intimately linked through the roles they play in enumerating partitions of n-sets. In a previous article we studied a generalization of the Bell numbers that arose on analyzing partitions of a special multiset. It is only natural, therefore, next to examine the corresponding situation for Stirling numbers of the second kind. In this paper we derive generating functions, formulae and interesting properties of these numbers. 1 Introduction In [6] we studied the enumeration of partitions of a particular family of multisets. Whereas all the n elements of a finite set are distinguishable, the elements of a multiset are allowed to 1 possess multiplicities greater than 1. A multiset may therefore be regarded as a generalization of a set. Indeed, a set is a multiset in which each of the elements has multiplicity 1. The enumeration of partitions of the special multisets we considered gave rise to families of numbers that we termed generalized near-Bell numbers. In this follow-up paper we study the corresponding generalization of Stirling numbers of the second kind.
    [Show full text]
  • Expansions of Generalized Euler's Constants Into the Series Of
    Journal of Number Theory 158 (2016) 365–396 Contents lists available at ScienceDirect Journal of Number Theory www.elsevier.com/locate/jnt Expansions of generalized Euler’s constants into −2 the series of polynomials in π and into the formal enveloping series with rational coefficients only Iaroslav V. Blagouchine 1 University of Toulon, France a r t i c l e i n f o a b s t r a c t Article history: In this work, two new series expansions for generalized Received 1 January 2015 Euler’s constants (Stieltjes constants) γm are obtained. The Received in revised form 26 June first expansion involves Stirling numbers of the first kind, 2015 − contains polynomials in π 2 with rational coefficients and Accepted 29 June 2015 converges slightly better than Euler’s series n−2. The Available online 18 August 2015 Communicated by David Goss second expansion is a semi-convergent series with rational coefficients only. This expansion is particularly simple and Keywords: involves Bernoulli numbers with a non-linear combination of Generalized Euler’s constants generalized harmonic numbers. It also permits to derive an Stieltjes constants interesting estimation for generalized Euler’s constants, which Stirling numbers is more accurate than several well-known estimations. Finally, Factorial coefficients in Appendix A, the reader will also find two simple integral Series expansion definitions for the Stirling numbers of the first kind, as well Divergent series Semi-convergent series an upper bound for them. Formal series © 2015 Elsevier Inc. All rights reserved. Enveloping series Asymptotic expansions Approximations Bernoulli numbers Harmonic numbers Rational coefficients Inverse pi E-mail address: [email protected].
    [Show full text]
  • Sets of Iterated Partitions and the Bell Iterated Exponential Integers
    Sets of iterated Partitions and the Bell iterated Exponential Integers Ivar Henning Skau University of South-Eastern Norway 3800 Bø, Telemark [email protected] Kai Forsberg Kristensen University of South-Eastern Norway 3918 Porsgrunn, Telemark [email protected] March 21, 2019 Abstract It is well known that the Bell numbers represent the total number of partitions of an n-set. Similarly, the Stirling numbers of the second kind, represent the number of k-partitions of an n-set. In this paper we introduce a certain partitioning process that gives rise to a sequence of sets of ”nested” partitions. We prove that at stage m, the cardinality of the resulting set will equal the m-th order Bell number. This set- theoretic interpretation enables us to make a natural definition of higher order Stirling numbers and to study the combinatorics of these entities. The cardinality of the elements of the constructed ”hyper partition” sets are explored. 1 A partitioning process. arXiv:1903.08379v1 [math.CO] 20 Mar 2019 (1) Consider the 3-set S = {a,b,c}. The partition set ℘3 of S, where the elements of S are put into boxes, contains the five partitions shown in the second column of Figure 1. Now we proceed, putting boxes into boxes. This means that we create a second (1) order partition set to each first order partition in ℘3 . The union of all the (2) second order partition sets is denoted by ℘3 , and appears in the third column of Figure 1. 1 (0) (1) (2) S = ℘3 ℘3 ℘3 { abc {a,b,c} { abc , , c ab c ab c ab , , , ac ac b ac b b , , , a bc a bc a bc , , , a c a b c a b c b } , , a c b b c a a b c , , } (1) (2) Figure 1: The basic set S together with the partition sets ℘3 and ℘3 (1) (m) Definition.
    [Show full text]
  • A Determinant Expression for the Generalized Bessel Polynomials
    Hindawi Publishing Corporation Journal of Applied Mathematics Volume 2013, Article ID 242815, 6 pages http://dx.doi.org/10.1155/2013/242815 Research Article A Determinant Expression for the Generalized Bessel Polynomials Sheng-liang Yang and Sai-nan Zheng Department of Applied Mathematics, Lanzhou University of Technology, Lanzhou, Gansu 730050, China Correspondence should be addressed to Sheng-liang Yang; [email protected] Received 5 June 2013; Accepted 25 July 2013 Academic Editor: Carla Roque Copyright © 2013 S.-l. Yang and S.-n. Zheng. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Using the exponential Riordan arrays, we show that a variation of the generalized Bessel polynomial sequence is of Sheffer type, and we obtain a determinant formula for the generalized Bessel polynomials. As a result, the Bessel polynomial is represented as determinant the entries of which involve Catalan numbers. − 1. Introduction Let (, ) denote the coefficient of in −1().We call (, ) a signless Bessel number of the first kind and − The Bessel polynomials form a set of orthogonal polyno- (, ) = (−1) (, ) aBesselnumberofthefirst mials on the unit circle in the complex plane. They are kind. The Bessel number of the second kind (, ) is important in certain problems of mathematical physics; defined to be the number of set partitions of [] := for example, they arise in the study of electrical net- {1,2,3,...,} into blocks of size one or two. Han and works and when the wave equation is considered in spher- Seo [3] showed that the two kinds of Bessel numbers are ical coordinates.
    [Show full text]
  • Recurrence Relation Lower and Upper Bounds Maximum Parity Simple
    From Wikipedia, the free encyclopedia In mathematics, particularly in combinatorics, a Stirling number of the second kind (or Stirling partition number) is the number of ways to partition a set of n objects into k non-empty subsets and is denoted by or .[1] Stirling numbers of the second kind occur in the field of mathematics called combinatorics and the study of partitions. Stirling numbers of the second kind are one of two kinds of Stirling numbers, the other kind being called Stirling numbers of the first kind (or Stirling cycle numbers). Mutually inverse (finite or infinite) triangular matrices can be formed from the Stirling numbers of each kind according to the parameters n, k. 1 Definition The 15 partitions of a 4-element set 2 Notation ordered in a Hasse diagram 3 Bell numbers 4 Table of values There are S(4,1),...,S(4,4) = 1,7,6,1 partitions 5 Properties containing 1,2,3,4 sets. 5.1 Recurrence relation 5.2 Lower and upper bounds 5.3 Maximum 5.4 Parity 5.5 Simple identities 5.6 Explicit formula 5.7 Generating functions 5.8 Asymptotic approximation 6 Applications 6.1 Moments of the Poisson distribution 6.2 Moments of fixed points of random permutations 6.3 Rhyming schemes 7 Variants 7.1 Associated Stirling numbers of the second kind 7.2 Reduced Stirling numbers of the second kind 8 See also 9 References The Stirling numbers of the second kind, written or or with other notations, count the number of ways to partition a set of labelled objects into nonempty unlabelled subsets.
    [Show full text]
  • René Gy Rene. Gy@ Numericable
    #A67 INTEGERS 20 (2020) BERNOULLI-STIRLING NUMBERS Ren´eGy [email protected] Received: 5/29/19, Revised: 2/29/20, Accepted: 8/13/20, Published: 8/31/20 Abstract Congruences modulo prime powers involving generalized Harmonic numbers are known. While looking for similar congruences, we have encountered a curious tri- angular array of numbers indexed with positive integers n; k, involving the Bernoulli and cycle Stirling numbers. These numbers are all integers and they vanish when n − k is odd. This triangle has many similarities with the Stirling triangle. In particular, we show how it can be extended to negative indices and how this ex- tension produces a second kind of such integers which may be considered as a new generalization of the Genocchi numbers and for which a generating function is easily obtained. But our knowledge of these integers remains limited, especially for those of the first kind. 1. Introduction Let n and k be non-negative integers and let the generalized Harmonic numbers (k) (k) Hn , Gn be defined as n X 1 H(k) := ; n jk j=1 (k) X 1 Gn := , i1i2 ··· ik 1≤i1<i2<··<ik≤n (1) (1) Pn 1 (0) (0) with Hn = Gn = j=1 j = Hn = Gn; Hn = n and Gn = 1. We have [10] n + 1 = n!G(k); k + 1 n n k being the cycle Stirling number (or unsigned Stirling number of the first kind), so that the Harmonic and cycle Stirling numbers are inter-related by the convolution k−1 n + 1 X n + 1 k = − (−1)k−jH(k−j) , (1.1) k + 1 n j + 1 j=0 2 which is obtained as a direct application of the well-known relation between ele- mentary symmetric polynomials and power sums [9].
    [Show full text]