Results 11 to 20 of about 4,691 (197)

On the Performances of $N$th Best User Selection Scheme in Multiuser Diversity Free-Space Optical Systems Over Exponentiated Weibull Turbulence Channels

IEEE Photonics Journal, 2016
The average bit error rate (ABER) and capacity of multiuser diversity free-space optical (FSO) systems with $N$th best user selection scheme are investigated by considering atmospheric turbulence-induced fading.
Ping Wang, Nan Xiang, Quanxue Gao, Ranran Wang, Lixin Guo, Yintang Yang   +5 more
doaj   +1 more source

Representations of Stirling Numbers of the First Kind by Multiple Integrals

Integers, 2015
See the abstract in the attached pdf.
Takashi Agoh, Karl Dilcher
openaire   +3 more sources

On degenerate multi-poly-derangement polynomials and numbers

Applied Mathematics in Science and Engineering
The problem of counting derangements was begun in 1708 by Pierre R[Formula: see text]mond de Montmort (see [Carlitz. The number of derangements of a sequence with given specification. Fibonacci Quart. 1978;16:255–258], [Clarke and Sved.
Sang Jo Yun, Jin-Woo Park
doaj   +1 more source

Labeled graph rearrangements on matched and star products

Electronic Journal of Graph Theory and Applications
In this paper we present enumerative results for Stirling numbers of the first kind for two graph products, the matched product and the m-star, using the combinatorial model of rearrangements.
Amir Barghi, Daryl DeFord
doaj   +1 more source

Closed Form Expressions for the Stirling Numbers of the First Kind

Integers, 2017
See the abstract in the attached pdf.
José A. Adell, Alberto Lekuona
openaire   +4 more sources

Asymptotic expansions for the stirling numbers of the first kind

Journal of Combinatorial Theory, Series A, 1995
Let \(s(n, m)\) denote the unsigned Stirling numbers of the first kind. For any \(\eta> 0\) and natural number \(v\), the following asymptotic formula holds uniformly \[ {s(n, m)\over n!}= {1\over n} \sum_{0\leq k\leq v} {\Pi_{m,k} (\log n)\over n^k}+ O \Biggl({(\log n)^m\over m!n^{v+ 2}}\Biggr) \] for \(1\leq m\leq \eta\log n\), where \(\Pi_{m, k}(x)\)
openaire   +1 more source

A Symmetric Sum Involving the Stirling Numbers of the First Kind

European Journal of Combinatorics, 1984
Let \(\{a_i\}^n_{i=1}\) be a sequence of natural numbers, \(0\leq a_i\leq n\) for \(i=1,\dots,n\), and \(A_{nm}\) be an \(n\times m\) array associated with this sequence, whose entries \(\alpha_{ij}=0,1\) such that \(\sum_{j=1}^m \alpha_{ij}=a_i\), \(i=1,\dots,n\), \(j=1,\dots,m\).
A. M. Khidr, B. S. El-Desouky
openaire   +1 more source

Explicit upper bounds for the Stirling numbers of the first kind

Journal of Combinatorial Theory, Series A, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +4 more sources

The asymptotic behavior of the stirling numbers of the first kind

Journal of Combinatorial Theory, Series A, 1993
The asymptotic expansion for the Stirling number of the first kind \({n \brack k}\) for fixed \(k\) together with examples has been obtained.
openaire   +1 more source

Three closed forms for convolved Fibonacci numbers

Results in Nonlinear Analysis, 2020
In the paper, by virtue of the Faà di Bruno formula and several properties of the Bell polynomials of the second kind, the author computes higher order derivatives of the generating function of convolved Fibonacci numbers and, consequently, derives three
Feng Qi
doaj