Related papers: Mixed restricted Stirling numbers
Some models of clustering processes are formulated and analytically solved employing generating functions methods. Those models include events which result from combined action of the coagulation and fragmentation processes. Fragmentation…
Generating functions for plane overpartitions are obtained using various methods such as nonintersecting paths, RSK type algorithms and symmetric functions. We extend some of the generating functions to cylindric partitions. Also, we show…
We find limit shapes for a family of multiplicative measures on the set of partitions, induced by exponential generating functions with expansive parameters, $a_k\sim Ck^{p-1}, k\to\infty, p>0$,where $C$ is a positive constant. The measures…
Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the…
We study the restricted growth function associated with set partitions, and obtain exact formulas for the number of strong records with height one, the total of record heights over set of partitions, and the number of partitions with a…
We study the enumeration of set partitions, according to their length, number of parts, cyclic type, and genus. We introduce genus-dependent Bell, Stirling numbers, and Fa\`a di Bruno coefficients. Besides attempting to summarize what is…
We investigate some weighted integer partitions whose generating functions are double-series. We will establish closed formulas for these $q$-double series and deduce that their coefficients are non-negative. This leads to inequalities…
A simple phenomenological model of a binary granular mixture is developed and investigated numerically. We attempt to model the experimental system of [1,2] where a horizontally vibrated binary monolayer was found to exhibit a transition…
We use analytic combinatorics to give a direct proof of the closed formula for the generating function of $p$-Bernoulli numbers.
We introduce multinomial and $r$-variants of several classic objects of combinatorial probability, such as the random recursive and Hoppe trees, random set partitions and compositions, the Chinese restaurant process, Feller's coupling, and…
We study the combinatorics of two classes of basic hypergeometric series. We first show that these series are the generating functions for certain overpartition pairs defined by frequency conditions on the parts. We then show that when…
In this article combinatorial aspects of normal ordering annihilation and creation operators of a multi-mode boson system are discussed. The modes are assumed to be coupled since otherwise the problem of normal ordering is reduced to the…
Recently, Andrews gave a detailed study of partitions with even parts below odd parts in which only the largest even part appears an odd number of times. In this paper, we provide a combinatorial proof of the generating function identity of…
In this note, we consider ordered partitions of integers such that each entry is no more than a fixed portion of the sum. We give a method for constructing all such compositions as well as both an explicit formula and a generating function…
Sequences are often conveniently encoded in the form of a generating function depending on a formal variable. This note presents two observations that allow one to draw conclusions about the generated sequence from the generating function.…
We derive new formulas for the number of unordered (distinct) factorizations with $k$ parts of a positive integer $n$ as sums over the partitions of $k$ and an auxiliary function, the number of partitions of the prime exponents of $n$,…
The main object of this paper is to construct a new generating function of the (q-) Bernstein type polynomials. We establish elementary properties of this function. By using this generating function, we derive recurrence relation and…
For $n$ and $k$ integers we introduce the notion of some partition of $n$ being able to generate another partition of $n$. We solve the problem of finding the minimum size partition for which the set of partitions this partition can…
This paper proves why the Stirling numbers show up in a experimentally determined formula for the $k$-bonaccis. We develop a bijection between a previously determined summation formula for $k$-bonaccis and an experimentally determined…
In this paper, we introduce a natural geometric extension of the partition function. More precisely, we investigate the problem of counting partitions of a rectangle into rectangular blocks with integer sides. Here, two partitions of a…