Related papers: On Bell numbers of type $D$

The aim of this note is to provide a simple proof of some well-known identities and recurrences relating classical Bernoulli and Euler numbers by using the Abel sum of the divergent series $\sum_{n=0}^\infty (-1)^{n} (n+1)^k$, $k$ a…

A ballot permutation is a permutation {\pi} such that in any prefix of {\pi} the descent number is not more than the ascent number. In this article, we obtained a formula in close form for the multivariate generating function of {A(n,d,j)},…

Main purpose of this paper is to reconstruct generating function of the Bernstein type polynomials. Some properties this generating functions are given. By applying this generating function, not only derivative of these polynomials but also…

In this paper, we study the degenerate central complete and incomplete Bell polynomials which are degenerate versions of the recently introduced central complete and incomplete Bell polynomials and also central analogues for the degenerate…

For any function F(x) having a Taylor expansion we solve the boson normal ordering problem for F[(a*)^r a^s], with r,s positive integers,[a,a*]=1, i.e. we provide exact and explicit expressions for its normal form which has all a's to the…

In this paper, we study various classes of partition functions such as those related to the parity of the number of parts, to differences of partition numbers, and to partitions with a repeated smallest part. We establish identities…

In the paper, in light of the generating function of the complete Bell polynomials and other techniques, the author presents concise and elegant proofs of three formulas for the complete Bell polynomials.

We prove an upper bound for the exponential sum associated to a localized $k-$divisor function, i.e., the counting function of the number of ways to write a positive integer $n$ as a product of $k\ge 2$ positive integers, each of them…

In this paper, we study a composition of exponential generating functions. We obtain new properties of this composition, which allow to distinguish prime numbers from composite numbers. Using the result of paper we get the known properties…

We consider sequences of polynomials that satisfy differential-difference recurrences. Polynomials satisfying such recurrences frequently appear as generating polynomials of integer valued random variables that are of interest in discrete…

We derive the P-finite recurrences for classes of sequences with ordinary generating function containing roots of polynomials. The focus is on establishing the D-finite differential equations such that the familiar steps of reducing their…

We generalize the well known Glaisher partition bijection result. For given positive integers n, d, both greater than 1, we provide a rich family of bijections between the set of partitions of n where at least one part is divisible by d,…

For a positive integer $n$, let $B_{\ell_1,\dots,\ell_r}(n)$ denote the number of $(\ell_1,\ell_2,\cdots,\ell_r)$-regular multipartitions of $n$. If $\ell_1=\ell_2=\cdots=\ell_r=\ell$, then we denote $B_{\ell_1,\dots,\ell_r}(n)$ as…

In this paper, for every $n \in \mathbb{N}$, the following relationships between the functions $K_{b}(n)$ and $K_{e}(n)$ and the Bernoulli and Euler numbers are proved: \[ B_{2n} = -\,\frac{(2n)!}{2^{2n}-2}\, K_{b}(n), \qquad E_{2n} =…

We present bipartite Bell-type inequalities which allow the two partners to use some non-local resource. Such inequality can only be violated if the parties use a resource which is more non-local than the one permitted by the inequality. We…

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…

Spivey's combinatorial method revealed an important identity for Bell numbers, involving Stirling numbers of the second kind. This paper extends his work by deriving Spivey-type recurrence relations for fully degenerate Bell polynomials and…

The paper introduce a new type of partitions where the largest part appears exactly once, and the remaining parts constitute a partition of that largest part. We derive the generating function associated with these partitions and…

We consider a class of generating functions analogous to the generating function of the partition function and establish a bound on the primes $\ell$ for which their coefficients $c(n)$ obey congruences of the form $c(\ell n + a) \equiv 0…

E394 in the Enestrom index. Translated from the Latin original, "De partitione numerorum in partes tam numero quam specie datas" (1768). Euler finds a lot of recurrence formulas for the number of partitions of $N$ into $n$ parts from some…