نتایج جستجو برای: stirling numbers of the second kind

تعداد نتایج: 22811970  

Journal: :Applicable Analysis and Discrete Mathematics 2021

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.

Journal: :Discrete Mathematics 2009
Yaming Yu

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.

Journal: :Journal of Combinatorial Theory, Series A 1995

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه علوم پایه دامغان 1389

in this thesis, ‎‎using‎‎ ‎concept‎s‎ ‎of‎ ‎wavelet‎s‎ ‎theory ‎‎‎som‎e‎ ‎methods‎‎ ‎of‎ ‎th‎e ‎solving‎‎ ‎optimal‎‎ ‎‎con‎tr‎ol‎ problems ‎(ocps)‎‎. ‎g‎overned by time-delay systems is investigated. ‎th‎is‎ thesis contains ‎tw‎o parts. ‎‎first, the method of obtaining ‎o‎f ‎the‎ ‎‎ocps‎ in time delay systems by linear legendre multiwavelets is ‎ ‎presented‎.‎‎‎‎ the main advantage of the meth...

2009
SHAOFANG HONG JIANRONG ZHAO WEI ZHAO

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 ...

Journal: :Graphs and Combinatorics 2016
David Galvin

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 ...

Journal: :Revista De La Real Academia De Ciencias Exactas Fisicas Y Naturales Serie A-matematicas 2021

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.

Journal: :Discrete Mathematics 2014
Pietro Codara Ottavio M. D'Antona Pavol Hell

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...

2012
JIANG ZENG

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...

Journal: :Eur. J. Comb. 2012
Ira M. Gessel Zhicong Lin Jiang Zeng

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...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید