Related papers: Mixed restricted Stirling numbers

In the paper, 2 explicit formulas for the Euler numbers of the second kind are obtained. Based on those formulas a exponential generating function is deduced. Using the generating function some well-known and new identities for the Euler…

We generalize overpartitions to (k,j)-colored partitions: k-colored partitions in which each part size may have at most j colors. We find numerous congruences and other symmetries. We use a wide array of tools to prove our theorems:…

For a mixed stochastic differential equation involving standard Brownian motion and an almost surely H\"older continuous process $Z$ with H\"older exponent $\gamma>1/2$, we establish a new result on its unique solvability. We also establish…

We investigate a generalization of stacks that we call $\mathcal{C}$-machines. We show how this viewpoint rapidly leads to functional equations for the classes of permutations that $\mathcal{C}$-machines generate, and how these systems of…

In the paper, the authors present several new relations and applications for the combinatorial sequence that counts the possible partitions of a finite set with the restriction that the size of each block is contained in a given set. One of…

We continue to consider the ordered lexicographic sequence, which is constructed according to the formal characteristics of a series of natural numbers. For analysis, we selected balanced parentheses with zeros, Motzkin words. As you know,…

In this paper starting process with the infinite number of types of particles \mu(t) generate stopped branching process \xi(t), if by falling of the first one into the non empty set S process stops. Here we consider the generating…

Several combinatorial identities are presented, involving Stirling functions of the second kind with a complex variable. The identities involve also Stirling numbers of the first kind, binomial coefficients and harmonic numbers.

A procedure to obtain the symbolic dynamics for conservative dynamical systems is introduced with reference to the standard map in a strongly chaotic regime. The method extends an approach previously developed for highly dissipative…

We characterize separable multidimensional permutations in terms of forbidden patterns and enumerate them by means of generating function, recursive formula and explicit formula. We find a connection between multidimensional permutations…

We describe a generating tree approach to the enumeration and exhaustive generation of k-nonnesting set partitions and permutations. Unlike previous work in the literature using the connections of these objects to Young tableaux and…

We study the number $p(n,t)$ of partitions of $n$ with difference $t$ between largest and smallest parts. Our main result is an explicit formula for the generating function $P_t(q) := \sum_{n \ge 1} p(n,t) \, q^n$. Somewhat surprisingly,…

Various specifiable combinatorial structures, with d extensive parameters, can be exactly sampled both by the recursive method, with linear arithmetic complexity if a heavy preprocessing is performed, or by the Boltzmann method, with…

A formula is derived that provides generating functions for any multi-j-symbol, such as the 3-j-symbol, the 6-j-symbol, the 9-j-symbol, etc. The result is completely determined by geometrical objects (loops and curves) in the graph of the…

Here we consider the degenerate Bernstein polynomials as a degenerate version of Bernstein polynomials, which are motivated by Simsek's recent work 'Generating functions for unification of the multidimensional Bernstein polynomials and…

The main aim of this paper is to provide a novel approach to deriving identities for the Bernstein polynomials using functional equations. We derive various functional equations and differential equations using generating functions.…

We present a new partition identity and give a combinatorial proof of our result. This generalizes a result of Andrew's in which he considers the generation function for partitions with respect to size, number of odd parts, and number of…

We consider $(k,j)$-colored partitions, partitions in which $k$ colors exist but at most $j$ colors may be chosen per size of part. In particular these generalize overpartitions. Advancing previous work, we find new congruences, including…

For any positive integer r, the r-associated Stirling number of the second kind enumerates the number of partitions of the set{1,2,3,...,n} into k non-empty disjoint subsets such that each subset contains at least r elements. We introduce…

Partition of unities appear in many places in analysis. Typically they are generated by compactly supported functions with a certain regularity. In this paper we consider partition of unities obtained as integer-translates of entire…