Related papers: On Bell numbers of type $D$
M. E. Cesaro (1885) gave a quite remarkable expression for the Bell number --the number of partitions of an n-element set -- as a definite integral. This note is an exposition, correcting a typographical error in the original.
We introduce a family of sequence transformations, defined via partial Bell polynomials, that may be used for a systematic study of a wide variety of problems in enumerative combinatorics. This family includes some of the transformations…
We establish new operational formulae of Burchnall type for the complex disk polynomials (generalized Zernike polynomials). We then use them to derive some interesting identities involving these polynomials. In particular, we establish…
In this paper, we introduce a class of new generalized super Bell polynomials on a superspace, explore their properties, and show that they are a natural and effective tool to systematically investigate integrability of supersymmetric…
In the paper, the author finds an explicit formula for computing Bell numbers in terms of Lah numbers and Stirling numbers of the second kind.
Consideration of a classification of the number of partitions of a natural number according to the members of sub-partitions differing from unity leads to a non-recursive formula for the number of irreducible representations of the…
The relations between the Bernoulli and Eulerian polynomials of higher order and the complete Bell polynomials are found that lead to new identities for the Bernoulli and Eulerian polynomials and numbers of higher order. General form of…
For any positive integers $a$ and $b$, we enumerate all colored partitions made by noncrossing diagonals of a convex polygon into polygons whose number of sides is congruent to $b$ modulo $a$. For the number of such partitions made by a…
Stanley defined a partition function t(n) as the number of partitions $\lambda$ of n such that the number of odd parts of $\lambda$ is congruent to the number of odd parts of the conjugate partition $\lambda'$ modulo 4. We show that t(n)…
In this paper, we use the Lambert series generating function for Euler's totient function to introduce a new identity for the number of $1$'s in the partitions of $n$. A new expansion for Euler's partition function $p(n)$ is derived in this…
In this paper, by introducing the degenerate Fubini-type polynomials, we give several relations with the help of the Fa\`a di Bruno formula and some properties of Bell polynomials, and generating function methods. Also, we derive some new…
The Stirling numbers of the first kind can be represented in terms of a new class of polynomials that are closely related to the Bernoulli polynomials. Recursion relations for these polynomials are given.
By establishing an interesting connection between ordinary Bell polynomials and rational convolution powers, some composition and inverse relations of Bell polynomials as well as explicit expressions for convolution roots of sequences are…
Bell polynomials appear in several combinatorial constructions throughout mathematics. Perhaps most naturally in the combinatorics of set partitions, but also when studying compositions of diffeomorphisms on vector spaces and manifolds, and…
In this paper, we show that the repetitive cluster category of type $D_n$, defined as the orbit category $\mathcal{D}^b(\mathrm{mod}K D_n)/(\tau^{-1}[1])^p$, is equivalent to a category defined on a subset of tagged edges in a regular…
Associated to each random variable $Y$ having a finite moment generating function, we introduce a different generalization of the Stirling numbers of the second kind. Some characterizations and specific examples of such generalized numbers…
Let B_n denote the nth Bell number. We use well-known recursive expressions for B_n to give a generalizing recursion that can be used to prove Touchard's congruence.
We introduce the notion of multiplication kernels of birational and $D$-module type and give various examples. We also introduce the notion of a semi-classical multiplication kernel associated with an integrable system and discuss its…
A recurrent formula is presented, for the enumeration of the compositions of positive integers as sums over multisets of positive integers, that closely resembles Euler's recurrence based on the pentagonal numbers, but where the…
We demonstrate that statistics for several types of set partitions are described by generating functions which appear in the theory of integrable equations.