Results 111 to 120 of about 1,345 (195)

On r-Central Incomplete and Complete Bell Polynomials

open access: yes, 2019
Here we would like to introduce the extended r-central incomplete and complete Bell polynomials, as multivariate versions of the recently studied extended r-central factorial numbers of the second kind and the extended r-central Bell polynomials, and ...
Dae San Kim   +3 more
core   +1 more source

On Stirling and bell numbers of order 1/2

open access: yesFilomat
The Stirling numbers of order 1/2 (of the second kind) introduced by Katugampola are discussed and it is shown that they are given by a scaled subfamily of the generalized Stirling numbers introduced by Hsu and Shiue. This allows to deduce in a straightforward fashion many properties of the Stirling and Bell numbers of order 1/2, for ...
openaire   +1 more source

The Boson normal ordering problem and generalized Bell numbers

open access: yes, 2003
For any function F(x) having a Taylor expansion we solve the boson normal ordering problem for $F[(a^\dag)^ra^s]$, with r, s positive integers, $[(a, a^\dag]=1$, i.e., we provide exact and explicit expressions for its normal form $\mathcal{N} \{F[(a^\dag)
Penson, K.A.   +5 more
core   +1 more source

Zeros distribution and interlacing property for certain polynomial sequences

open access: yesOpen Mathematics
In this article, we first prove that the Hankel determinant of order three of the polynomial sequence {Pn(x)=∑k≥0P(n,k)xk}n≥0{\left\{{P}_{n}\left(x)={\sum }_{k\ge 0}P\left(n,k){x}^{k}\right\}}_{n\ge 0} is weakly (Hurwitz) stable, where P(n,k)P\left(n,k ...
Guo Wan-Ming
doaj   +1 more source

Stirling Numbers Interpolation using Permutations with Forbidden Subsequences

open access: yes, 2000
We present a family of number sequences which interpolates between the sequences Bn , of Bell numbers, and n!. It is defined in terms of permutations with forbidden patterns or subsequences.
G. Labelle   +3 more
core  

Bell Numbers of Complete Multipartite Graphs [PDF]

open access: yes, 2016
The {\it Stirling number} $S(G;k)$ is the number of partitions of the vertices of a graph $G$ into $k$ nonempty independent sets and the number of all partitions of $G$ is its {\it Bell number}, $B(G)$.
Christopher Serkan, Julian Allagan
core  

SHIFTING POWERS IN SPIVEY'S BELL NUMBER FORMULA. [PDF]

open access: yesQuaest Math, 2022
Mansour T   +3 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy