Results 11 to 20 of about 67,232 (280)
Note on r-central Lah numbers and r-central Lah-Bell numbers
AIMS Mathematics, 2022 The r-Lah numbers generalize the Lah numbers to the r-Stirling numbers in the same sense. The Stirling numbers and the central factorial numbers are one of the important tools in enumerative combinatorics. The r-Lah number counts the number of partitions
Hye Kyung Kim
doaj +1 more source
Combinatorial Models of the Distribution of Prime Numbers
Mathematics, 2021 This work is divided into two parts. In the first one, the combinatorics of a new class of randomly generated objects, exhibiting the same properties as the distribution of prime numbers, is solved and the probability distribution of the combinatorial ...
Vito Barbarani
doaj +1 more source
Elliptic rook and file numbers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 In this work, we construct elliptic analogues of the rook numbers and file numbers by attaching elliptic weights to the cells in a board. We show that our elliptic rook and file numbers satisfy elliptic extensions of corre- sponding factorization ...
Michael J. Schlosser, Meesue Yoo
doaj +1 more source
AIMS Mathematics, 2019 In the paper, by virtue of the Faà di Bruno formula, some properties of the Bell polynomials of the second kind, and an inversion formula for the Stirling numbers of the first and second kinds, the authors establish meaningfully and significantly two ...
Feng Qi, Da-Wei Niu, Bai-Ni Guo
doaj +1 more source
Generalized Fock spaces and the Stirling numbers [PDF]
, 2018 The Bargmann-Fock-Segal space plays an important role in mathematical physics, and has been extended into a number of directions. In the present paper we imbed this space into a Gelfand triple. The spaces forming the Fr\'echet part (i.e.
Alpay D. +14 more
core +3 more sources
Combinatorially interpreting generalized Stirling numbers [PDF]
, 2014 Let $w$ be a word in alphabet $\{x,D\}$ with $m$ $x$'s and $n$ $D$'s. Interpreting "$x$" as multiplication by $x$, and "$D$" as differentiation with respect to $x$, the identity $wf(x) = x^{m-n}\sum_k S_w(k) x^k D^k f(x)$, valid for any smooth function ...
Engbers, John +2 more
core +4 more sources
Mixed r-Stirling numbers of the second kind
Online Journal of Analytic Combinatorics, 2016 The Stirling number of the second kind \( S(n, k) \) counts the number of ways to partition a set of \( n \) labeled balls into \( k \) non-empty unlabeled cells. We extend this problem and give a new statement of the \( r \)-Stirling numbers of the second kind and \( r \)-Bell numbers.
Yaqubi, Daniel +2 more
openaire +3 more sources
Computing generating functions of ordered partitions with the transfer-matrix method [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 An ordered partition of $[n]:=\{1,2,\ldots, n\}$ is a sequence of disjoint and nonempty subsets, called blocks, whose union is $[n]$. The aim of this paper is to compute some generating functions of ordered partitions by the transfer-matrix method.
Masao Ishikawa +2 more
doaj +1 more source
Asymptotics of Stirling and Chebyshev‐Stirling Numbers of the Second Kind
Studies in Applied Mathematics, 2014 For the classical Stirling numbers of the second kind, asymptotic formulae are derived in terms of a local central limit theorem. The underlying probabilistic approach also applies to the Chebyshev–Stirling numbers, a special case of the Jacobi–Stirling numbers.
Gawronski, Wolfgang +2 more
openaire +1 more source
On stirling numbers of the second kind
Journal of Combinatorial Theory, 1969 AbstractWe first find inequalities between the Stirling numbers S(n, r) for fixed n, then introduce functions L and U such that L(n, r)≤S(n, r)≤U(n, r), and finally obtain the asymptotic value n/log n for the value of r for which S(n, r) is maximal.
Rennie, B.C., Dobson, A.J.
openaire +1 more source