Related papers: The $m$th-order Eulerian Numbers
In this article we obtain an explicit formula in terms of the partitions of the positive integer $n$ to express the $n$-th term of a wide class of sequences of numbers defined by recursion. Our proof is based only on arithmetics. We compare…
Stirling numbers of both kinds are linked to each other via two combinatorial identities due to Schl\"afli and Gould. Using q-analogs of Stirling numbers defined as inversion generating functions, we provide q-analogs of the two identities.…
In this paper we give an additive representation of the factorial, which can be proven by a simple quick analytical argument. We also present some generalizations, which are linked, on the one hand to an arithmetical theorem proven by Euler…
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…
We consider the numbers arising in the problem of normal ordering of expressions in canonical boson creation and annihilation operators. We treat a general form of a boson string which is shown to be associated with generalizations of…
In this article, we present relations for the Euler totient function $\varphi(n)$ and the number of divisors $\tau(n)$ in terms of finite sums of integer parts of rational numbers or greatest common divisors of pairs of integers. Some of…
In this paper, we define an ordering relation for a set of complex numbers, and research the properties and theorems of the ordering, solve some simple complex inequalities with the ordering.
Assume that the moment generating function of the random vari able Y exists in a neighborhood of the origin. We introduce the probabilistic multi-Stirling numbers of the second kind associated with Y and the proba bilistic multi-Lah numbers…
In this paper we consider mixed volumes of combinations of hypersimplices. These numbers, called "mixed Eulerian numbers", were first considered by A. Postnikov and were shown to satisfy many properties related to Eulerian numbers, Catalan…
The aim of this paper is by using generating functions to further study some identities and properties on the degenerate Stirling numbers of the second kind, the degenerate $r$-Stirling numbers of the second kind, the degenerate Stirling…
In this paper, we study relations among several types of Eulerian polynomials from a combinatorial viewpoint. We establish an identity between the restricted Eulerian polynomials of types $A$ and $B$. As an application, we present a…
We study several variants of Euler sums by using the methods of contour integration and residue theorem. These variants exhibit nice properties such as closed forms, reduction, etc., like classical Euler sums. In addition, we also define a…
In this article we generalize the $q$-difference operator due to Carlitz in order to derive explicit sum formulae for several extensions of Stirling numbers of the second kind, including complete homogeneous symmetric functions,…
In this paper we use computational method based on operational point of view to prove a new generating function of exponential polynomials. We give its applications involving geometric polynomials, Bernoulli and Euler numbers.
For any finite partially ordered set $P$, the $P$-Eulerian polynomial is the generating function for the descent number over the set of linear extensions of $P$, and is closely related to the order polynomial of $P$ arising in the theory of…
Following an idea due to Euler, we evaluate the alternating sums of powers of consrcutive integers.
Multiple harmonic-like numbers are studied using the generating function approach. A closed form is stated for binomial sums involving these numbers and two additional parameters. Several corollaries and examples are presented which are…
In this note we prove combinatorially some new formulas connecting poly-Bernoulli numbers with negative indices to Eulerian numbers.
In the paper, the author finds an explicit formula for computing Bernoulli numbers of the second kind in terms of Stirling numbers of the first kind.
The Stirling number of the second kind $n\brace k$ counts the number of ways to partition a set of $n$ labeled balls into $k$ non-empty unlabeled cells. As an extension of this, we consider $b_1+b_2+\ldots+b_n$ balls with $b_1$ balls…