相关论文: On some properties and relations between restricte…
When one inserts a number of identical bars in between blocks of an ordered set partition, they get a barred preferential arrangement. In this study we define a new generalization of barred preferential arrangements, by considering barred…
A preferential arrangement of a finite set is an ordered partition. Associated with each such ordered partition is a chain of subsets or blocks endowed with a linear order. The chain may be split into sections by the introduction of a…
A preferential arrangement of a set is a total ordering of the elements of that set with ties allowed. A barred preferential arrangement is one in which the tied blocks of elements are ordered not only amongst themselves but also with…
A barred preferential arrangement is a preferential arrangement onto which a number of identical bars are inserted in between the blocks of the preferential arrangement. In this study we examine combinatorial properties of barred…
Given an ordered set partition, when one insert a number of bars in-between the blocks of the ordered set partition the result is a barred preferential arrangement. In this study, using the notion of barred preferential arrangements we…
A barred preferential arrangement is a preferential arrangement, onto which in-between the blocks of the preferential arrangement a number of identical bars are inserted. We offer a generalisation of barred preferential arrangements by…
As properties of poly-Bernoulli numbers, a number of formulas such as the duality formula, explicit formula using the Stirling numbers of the second kind and periodicity for negative upper-index have been established. For the multi-indexed…
In this note we prove combinatorially some new formulas connecting poly-Bernoulli numbers with negative indices to Eulerian numbers.
In this paper, we consider the degenerate multi-poly-Bernoulli numbers and polynomials which are defined by means of the multiple polylogarithms and degenerate versions of the multi-poly-Bernoulli numbers and polynomials. We investigate…
Poly-Bernoulli numbers $B_n^{(k)}\in\mathbb{Q}$\,($n \geq 0$,\,$k \in \mathbb{Z}$) are defined by Kaneko in 1997. Multi-Poly-Bernoulli numbers\,$B_n^{(k_1,k_2,\ldots, k_r)}$, defined by using multiple polylogarithms, are generations of…
Poly-Bernoulli numbers are one of generalizations of the classical Bernoulli numbers. Since a negative index poly-Bernoulli number is an integer, it is an interesting problem to study this number from combinatorial viewpoint. In this short…
Set partitions and permutations with restrictions on the size of the blocks and cycles are important combinatorial sequences. Counting these objects lead to the sequences generalizing the classical Stirling and Bell numbers. The main focus…
In this paper, we consider Barnes' multiple Bernoulli and poly-Bernoulli mixed-type polynomials. From the properties of Sheffer sequences of these polynomials arising from umbrral calculus, we derive new and interesting identities.
We introduce a novel generalization of deranged Bell numbers by defining the partial deranged Bell numbers $w_{n,r}$, which count the number of set partitions of $\left[ n\right] $ with exactly $r$ fixed blocks, while the remaining blocks…
In this paper, we consider higher-order Bernoulli and poly-Bernoulli mixed type polynomials and we give some interesting identities of those polynomials arising from umbral calculus.
In this note we augment the poly-Bernoulli family with two new combinatorial objects. We derive formulas for the relatives of the poly-Bernoulli numbers using the appropriate variations of combinatorial interpretations. Our goal is to show…
In this paper, we consider Hermite and poly-Bernoulli mixed-type polynomials and investigate the properties of those polynomials which are derived from umbral calculus. Finally, we give various identities associated with Stirling numbers,…
The Stirling numbers of the first kind can be represented in terms of a new class of polynomials that are closely related to the Bernoulli polynomials. Recursion relations for these polynomials are given.
We prove certain identities involving Euler and Bernoulli polynomials that can be treated as recurrences. We use these and also other known identities to indicate connection of Euler and Bernoulli numbers with entries of inverses of certain…
Let $r\geq 1$ be an integer, $\mathbf a=(a_1,\ldots,a_r)$ a vector of positive integers and let $D\geq 1$ be a common multiple of $a_1,\ldots,a_r$. We study two natural determinants of order $rD$ with Bernoulli polynomials and we present…