Related papers: Combinatorial applications of the special numbers …
We study set partitions with $r$ distinguished elements and block sizes found in an arbitrary index set $S$. The enumeration of these $(S,r)$-partitions leads to the introduction of $(S,r)$-Stirling numbers, an extremely wide-ranging…
We introduce a class of $f(t)$-factorials, or $f(t)$-Pochhammer symbols, that includes many, if not most, well-known factorial and multiple factorial function variants as special cases. We consider the combinatorial properties of the…
Recently, degenerate Cauchy numbers and polynomials are introduced in [10]. In this paper, we study the degenerate Cauchy numbers and polynomials which are different from the previous degenerate Cauchy numbers and polynomials. In addition,…
In the paper, the authors find two closed forms involving the Stirling numbers of the second kind and in terms of a determinant of combinatorial numbers for the Bernoulli polynomials and numbers.
By considering Eulerian numbers and ordered Stirling numbers of the second and third kinds over a multiset, we generalize identities of Eulerian numbers and Stirling numbers of the second and third kinds and provide $q$-analogs of these…
We consider different generalizations of the Euler formula and discuss the properties of the associated trigonometric functions. The problem is analyzed from different points of view and it is shown that it can be formulated in a natural…
The powers of matrices with Stirling number-coefficients are investigated. It is revealed that the elements of these matrices have a number of properties of the ordinary Stirling numbers. Moreover, "higher order" Bell, Fubini and Eulerian…
We consider here a particular quadratic equation linking two elements of a C-Algebra. By analysing powers of the unknowns, it appears a double sequence of polynomials related to classical Bernoulli polynomials. We get the generating…
We study the explicit formula of Euler numbers and polynomials of higher order
In the present paper we generalize the Eulerian numbers (also of the second and third orders). The generalization is connected with an autonomous first-order differential equation, solutions of which are used to obtain integral…
In this paper, we consider the degenerate Changhee numbers and polynomials of the second kind which are different from the previously introduced degenerate Changhee numbers and polynomials by Kwon-Kim-Seo (see [11]). We investigate some…
In this paper we first present summation formulas for $k$-order Eulerian polynomials and $1/k$-Eulerian polynomials. We then present combinatorial expansions of $(c(x)D)^n$ in terms of inversion sequences as well as $k$-Young tableaux,…
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…
In recent years, studying degenerate versions of various special polynomials and numbers have attracted many mathematicians. Here we introduce degenerate type 2 Bernoulli polynomials, fully degenerate type 2 Bernoulli polynomials and…
The notion of block divisibility naturally leads one to introduce unitary cyclotomic polynomials. We formulate some basic properties of unitary cyclotomic polynomials and study how they are connected with cyclotomic, inclusion-exclusion and…
In this paper, we consider the degenerate Stirling polynomials of the second kind which are derived from the generating function. In addition, we give some new identities for these polynomials.
We give a new construction of q-Genocchi numbers, Euler numbers of higher order, which are different than the q-Genocchi numbers of Cangul-Ozden-Simsek. By using our q-Genoucchi, Euler nimbers of higher order, we can investigate the…
Recently, several authors have studied the Stirling numbers of the second kind and Bell polynomials. In this paper, we study the extended Stirling polynomials of the second kind and the extended Bell polynomials associated with the Stirling…
By using the elementary symmetric polynomials and some results of number theory, we solve the well known problem of Lehmer on Euler's totient function. As application, we obtain a new characterization of prime numbers.
The origin of this study is based on not only explicit formulas of finite sums involving higher powers of binomial coefficients, but also explicit evaluations of generating functions for this sums. It should be emphasized that this study…