Home OALib Journal OALib PrePrints Submit Ranking News My Lib FAQ About Us Follow Us+
 Title Keywords Abstract Author All
Search Results: 1 - 10 of 100 matches for " "
 Tian-Xiao He Mathematics , 2011, Abstract: Here presented is a unified approach to Stirling numbers and their generalizations as well as generalized Stirling functions by using generalized factorial functions, $k$-Gamma functions, and generalized divided difference. Previous well-known extensions of Stirling numbers due to Riordan, Carlitz, Howard, Charalambides-Koutras, Gould-Hopper, Hsu-Shiue, Tsylova Todorov, Ahuja-Enneking, and Stirling functions introduced by Butzer and Hauss, Butzer, Kilbas, and Trujilloet and others are included as particular cases of our generalization. Some basic properties related to our general pattern such as their recursive relations and generating functions are discussed. Three algorithms for calculating the Stirling numbers based on our generalization are also given, which include a comprehensive algorithm using the characterization of Riordan arrays.
 Mathematics , 2013, Abstract: A permutation $\sigma$ of a multiset is called Stirling permutation if $\sigma(s)\ge \sigma(i)$ as soon as $\sigma(i)=\sigma(j)$ and $i  Physics , 2010, DOI: 10.1109/TASC.2009.2019027 Abstract: A superconducting nanowire single photon detector (SNSPD) system for telecommunication wavelength using a GM cryocooler was developed and its performance was verified. The cryocooler based SNSPD system can operate continuously with a 100 V AC power supply without any cryogen. The packaged SNSPD device was cooled to 2.96 K within a thermal fluctuation range of 10 mK. An SNSPD with an area of 20 x 20$\mu m^2$showed good system detection efficiency (DE) at 100 Hz dark count rate of 2.6% and 4.5% at wavelengths of 1550 and 1310 nm, respectively. An SNSPD with an area of 10 x 10$\mu m^2$and kinetic inductance lower than that of the large area device showed good system DE of 2.6% at a wavelength of 1550 nm. The SNSPD system could be operated for over 10 h with constant system DE and dark count rate.  Mourad Rahmani Mathematics , 2012, Abstract: In this paper, algorithms are developed for computing the Stirling transform and the inverse Stirling transform; specifically, we investigate a class of sequences satisfying a two-term recurrence. We derive a general identity which generalizes the usual Stirling transform and investigate the corresponding generating functions also. In addition, some interesting consequences of these results related to classical sequences like Fibonacci, Bernoulli and the numbers of derangements have been derived.  Mathematics , 2013, Abstract: For the Chebyshev-Stirling numbers, a special case of the Jacobi-Stirling numbers, asymptotic formulae are derived in terms of a local central limit theorem. The underlying probabilistic approach also applies to the classical Stirling numbers of the second kind. Thereby a supplement of the asymptotic analysis for these numbers is established.  István Mez？ Mathematics , 2015, Abstract: It is known that the$S(n,k)$Stirling numbers as well as the ordered Stirling numbers$k!S(n,k)\$ form log-concave sequences. Although in the first case there are many estimations about the mode, for the ordered Stirling numbers such estimations are not known. In this short note we study this problem and some of its generalizations.