2014
DOI: 10.9734/bjmcs/2014/8093
|View full text |Cite
|
Sign up to set email alerts
|

A Combinatorial Approach for q-Analogue of r-Stirling Numbers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
2
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…, which is analogous to certain identity of [3]. But before that, let us consider first the following lemma from [10].…”
Section: Is the Set Of Allmentioning
confidence: 97%
“…, which is analogous to certain identity of [3]. But before that, let us consider first the following lemma from [10].…”
Section: Is the Set Of Allmentioning
confidence: 97%
“…In this section, the congruence relation modulo pq for the type 2 (p, q)-analogue of the r-Whitney numbers of the second kind W * m,r [n, k; t] p,q will be established using the rational generating function in (10).…”
Section: Divisibility Propertymentioning
confidence: 99%
“…This numbers have applications in combinatorial and statistical problems. Corcino and Aldema (2002) [6] further studied the (r, β)-Stirling numbers and derived some combinatorial identities related to them. Corcino and Montero (2009) [7] also investigated the (r, β)-Stirling numbers in the context of 0-1 tableaux, which are a tool used in algebraic combinatorics.…”
Section: Introductionmentioning
confidence: 99%