نتایج جستجو برای: stirling numbers of the second kind
تعداد نتایج: 22811970 فیلتر نتایج به سال:
Our perpose in this work is the complete study of Simsek numbers. We give answer to some open problems concerning polynomial representations and associated generating function. At end we investigate a new generalization these numbers obtain useful identities which connect Stirling second kind.
Let S(n, k) denote the Stirling number of the second kind, and let Kn be such that S(n,Kn − 1) < S(n,Kn) ≥ S(n,Kn + 1). Using a probabilistic argument, we show that, for all n ≥ 2, ⌊e⌋ − 2 ≤ Kn ≤ ⌊e ⌋+ 1, where ⌊x⌋ denotes the integer part of x, and w(n) denotes Lambert’s W function.
in this thesis, using concepts of wavelets theory some methods of the solving optimal control problems (ocps). governed by time-delay systems is investigated. this thesis contains two parts. first, the method of obtaining of the ocps in time delay systems by linear legendre multiwavelets is presented. the main advantage of the meth...
In this paper, we investigate the 2-adic valuation of the Stirling numbers S(n, k) of the second kind. We show that v2(S(2n + 1, k + 1)) = s2(n) − 1 for any positive integer n, where s2(n) is the sum of binary digits of n. This confirms a conjecture of Amdeberhan, Manna and Moll. We show also that v2(S(4i, 5)) = v2(S(4i + 3, 5)) if and only if i 6≡ 7 (mod 32). This proves another conjecture of ...
For a simple finite graph G denote by { G k } the number of ways of partitioning the vertex set of G into k non-empty independent sets (that is, into classes that span no edges of G). If En is the graph on n vertices with no edges then { En k } coincides with { n k } , the ordinary Stirling number of the second kind, and so we refer to { G k } as a graph Stirling number. Harper showed that the ...
In this paper, the author presents several closed forms and determinantal expressions involving Stirling numbers of second kind for higher-order Bernoulli Euler polynomials by applying Faà di Bruno formula some properties Bell polynomials.
In a series of papers, P. Blasiak et al. developed a wide-ranging generalization of Bell numbers (and of Stirling numbers of the second kind) that is relevant to the so-called Boson normal ordering problem. They provided a recurrence and, more recently, also offered a (fairly complex) combinatorial interpretation of these numbers. We show that by restricting the numbers somewhat (but still wide...
Abstract. We investigate the diagonal generating function of the Jacobi-Stirling numbers of the second kind JS(n+ k, n; z) by generalizing the analogous results for the Stirling and Legendre-Stirling numbers. More precisely, letting JS(n + k, n; z) = pk,0(n) + pk,1(n)z + · · ·+ pk,k(n)z , we show that (1− t) ∑ n≥0 pk,i(n)t n is a polynomial in t with nonnegative integral coefficients and provid...
We investigate the diagonal generating function of the Jacobi-Stirling numbers of the second kind JS(n+ k, n; z) by generalizing the analogous results for the Stirling and Legendre-Stirling numbers. More precisely, letting JS(n + k, n; z) = pk,0(n) + pk,1(n)z + · · ·+ pk,k(n)z, we show that (1− t)3k−i+1 ∑ n≥0 pk,i(n)t n is a polynomial in t with nonnegative integral coefficients and provide com...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید