Related papers: The $(l,r)$-Stirling numbers: a combinatorial appr…
We define a new family of generalized Stirling permutations that can be interpreted in terms of ordered trees and forests. We prove that the number of generalized Stirling permutations with a fixed number of ascents is given by a natural…
A symmetry of $(t,q)$-Eulerian numbers of type $B$ is combinatorially proved by defining an involution preserving many important statistics on the set of permutation tableaux of type $B$. This involution also proves a symmetry of the…
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.
The chromatic polynomials are studied by several authors and have important applications in different frameworks, specially, in graph theory and enumerative combinatorics. The aim of this work is to establish some properties of the…
In this paper, we consstruct a new extended q-Bernoulli numbers and poly nomials. From these numbers, we derive the multiple zeta functions and give some relations between multiple Bernoulli numbers and multiple zeta functions.
The first aim of this paper is to construct new generating functions for the generalized {\lambda}-Stirling type numbers of the second kind, generalized array type polynomials and generalized Eulerian type polynomials and numbers, attached…
The aim of this paper is to give a new approach to modified q-Bernstein polynomials for functions of two variables. By using these type polynomials, we derive recurrence formulas and some new interesting identities related to the second…
We introduce several statistics on ordered partitions of sets, that is, set partitions where the blocks are permuted arbitrarily. The distribution of these statistics is closely related to the q-Stirling numbers of the second kind. Some of…
The development of the theories of the second-order Eulerian polynomials began with the works of Buckholtz and Carlitz in their studies of an asymptotic expansion. Gessel-Stanley introduced Stirling permutations and presented combinatorial…
We define a number of related combinatorial objects, each of which possesses a surprising symmetry. We include several applications such as a combinatorial explanation for certain fixed points of the involution $\omega$ on the ring of…
The purpose of this paper is to investigate the connection between context-free grammars and normal ordering problem, and then to explore various extensions of the Stirling grammar. We present grammatical characterizations of several well…
The aim of this article is to define some new families of the special numbers. These numbers provide some further motivation for computation of combinatorial sums involving binomial coefficients and the Euler kind numbers of negative order.…
Recently, authors studied the unsigned degenerate r-Stirling number of the first kind and the degenerate r-Stirling number of the second kind, respectively of which are the degenerate versions of the unsigned r-Stirling numbers of the first…
We introduce Schur multiple zeta functions which interpolate both the multiple zeta and multiple zeta-star functions of the Euler-Zagier type combinatorially. We first study their basic properties including a region of absolute convergence…
We give a number of theoretical and practical methods related to the computation of L-functions, both in the local case (counting points on varieties over finite fields, involving in particular a detailed study of Gauss and Jacobi sums),…
A generalization of a well-known relation between the Riemann zeta function $\zeta(s)$ and Bernoulli numbers $B_n$ is obtained. The formula is a new representation of the Riemann zeta function in terms of a nested series of Bernoulli…
In this paper we are interested in Euler-type sums with products of harmonic numbers, Stirling numbers and Bell numbers. We discuss the analytic representations of Euler sums through values of polylogarithm function and Riemann zeta…
In this thesis, we apply the stack sorting operator to $r$-permutations and construct the functional equation for the generating function of two-stack-sortable $k$-tuple $r$-permutations counted by descents by using a factorization similar…
We exploit a bijection between plane recursive trees and Stirling permutations; this yields the equivalence of some results previously proven separately by different methods for the two types of objects as well as some new results. We also…
We derive two new identities involving the Bernoulli numbers, the Euler numbers, and the Stirling numbers of the first kind using analytic continuation of a well known identity for the Stirling numbers of the first kind.