Related papers: Partial Deranged Bell Numbers and Their Combinator…
In this paper we study q-Bernoulli numbers and polynomials related to q-Stirling numbers. From thsese studying we investigate some interesting q-stirling numbers' identities related to q-Bernoulli numbers.
In a recent paper, Carrell and Goulden found a combinatorial identity of the Bernstein operators that they then used to prove Bernstein's Theorem. We show that this identity is a straightforward consequence of the classical result. We also…
In the research, with aid of the Fa\`a di Bruno formula, be virtue of several identities for the Bell polynomials of the second kind, with help of two combinatorial identities, by means of the (logarithmically) complete monotonicity of…
A combinatorial methods are used to investigate some properties of certain generalized Stirling numbers, including explicit formula and recurrence relations. Furthermore, an expression of these numbers with symmetric function is deduced.
An ordered set-partition (or preferential arrangement) of n labeled elements represents a single ``hierarchy''; these are enumerated by the ordered Bell numbers. In this note we determine the number of ``hierarchical orderings'' or…
In this paper, we study classes of subexcedant functions enumerated by the Bell numbers and present bijections on set partitions. We present a set of permutations whose transposition arrays are the restricted growth functions, thus defining…
In this paper, we use our previous study of the higher order Bernoulli numbers $B_n^{(l)}$ to investigate the $p$-adic properties of the Stirling numbers of the second kind $S(n,k)$. For example, we give a new, greatly simplified proof of…
This paper introduces an alternative form of the derivation of Spivey's Bell number formula which involves the $q$-Boson operators $a$ and $a^{\dagger}$. Furthermore, a similar formula for the case of the $(q,r)$-Dowling polynomials is…
Bell inequalities are a vital tool to detect the nonlocal correlations, but the construction of them for multipartite systems is still a complicated problem. In this work, inspired via a decomposition of $(n+1)$-partite Bell inequalities…
In a previous paper, Mihoubi et al. introduced the $(r_{1},...,r_{p}) $-Stirling numbers and the $(r_{1},...,r_{p}) $-Bell polynomials and gave some of their combinatorial and algebraic properties. These numbers and polynomials generalize,…
We present a combinatorial method of constructing solutions to the normal ordering of boson operators. Generalizations of standard combinatorial notions - the Stirling and Bell numbers, Bell polynomials and Dobinski relations - lead to…
Let $B_t(n)$ be the number of set partitions of a set of size~$t$ into at most $n$ parts and let $B'_t(n)$ be the number of set partitions of $\{1,\ldots, t\}$ into at most $n$ parts such that no part contains both $1$ and~$t$ or both $i$…
In 2008, Spivey found a recurrence relation for the Bell numbers. We consider the probabilistic r-Bell polynomials associated with which are a probabilistic extension of the r-Bell polynomials. Here Y is a random variable whose moment…
In this paper, we consider central complete and incomplete Bell polynomials which are generalizations of the recently introduced central Bell polynomials and central analogues for the complete and incomplete Bell polynomials. We investigate…
A class of self-similar sets of entangled quantum states is introduced, for which a recursive definition is provided. These sets, the "Bell gems," are defined by the subsystem exchange symmetry characteristic of the Bell states. Each Bell…
The Bell inequalities in three and four correlations are re-derived in general forms showing that three and four data sets, respectively, identically satisfy them regardless of whether they are random, deterministic, measured, predicted, or…
In the paper, the author presents diagonal recurrence relations for the Stirling numbers of the first kind. As by-products, the author also recovers three explicit formulas for special values of the Bell polynomials of the second kind.
A set partition of $[n] := \{1, 2, \dots, n \}$ is called {\em $r$-Stirling} if the numbers $1, 2, \dots, r$ belong to distinct blocks. Haglund, Rhoades, and Shimozono constructed graded ring $R_{n,k}$ depending on two positive integers $k…
Let $f: \mathbb{Z}_+\rightarrow \mathbb{Z}_+$ be a polynomial with the property that corresponding to every prime $p$ there exists an integer $\ell$ such that $p\nmid f(\ell)$. In this paper, we establish some equidistributed results…
We obtain a new coding and decoding method using the generalized Pell $(p,i)$ -numbers. The relations among the code matrix elements, error detection and correction have been established for this coding theory. We give two new blocking…