Permutation Statistics and $q$-Fibonacci Numbers
نویسندگان
چکیده
منابع مشابه
Permutation Statistics and q-Fibonacci Numbers
In a recent paper, Goyt and Sagan studied distributions of certain set partition statistics over pattern restricted sets of set partitions that were counted by the Fibonacci numbers. Their study produced a class of q-Fibonacci numbers, which they related to q-Fibonacci numbers studied by Carlitz and Cigler. In this paper we will study the distributions of some Mahonian statistics over pattern r...
متن کاملSet partition statistics and q-Fibonacci numbers
We consider the set partition statistics ls and rb introduced by Wachs and White and investigate their distribution over set partitions avoiding certain patterns. In particular, we consider those set partitions avoiding the pattern 13/2, Πn(13/2), and those avoiding both 13/2 and 123, Πn(13/2, 123). We show that the distribution over Πn(13/2) enumerates certain integer partitions, and the distr...
متن کاملGENERALIZED q - FIBONACCI NUMBERS
We introduce two sets of permutations of {1, 2, . . . , n} whose cardinalities are generalized Fibonacci numbers. Then we introduce the generalized q-Fibonacci polynomials and the generalized q-Fibonacci numbers (of first and second kind) by means of the major index statistic on the introduced sets of permutations.
متن کاملArithmetic properties of q-Fibonacci numbers and q-pell numbers
We investigate some arithmetic properties of the q-Fibonacci numbers and the q-Pell numbers.
متن کاملQ-analogues of convolutions of Fibonacci numbers
Let NR([k]) denote the set of words over the alphabet [k] = {1, . . . , k} with no consecutive repeated letters. Given a word w = w1 . . . wn ∈ NR([k]), or more generally in [k]∗, we say that a pair 〈wi, wj〉 matches the μ pattern if i < j, wi < wj, and there is no i < k < j such that wi ≤ wk ≤ wj. We say that 〈wi, wj〉 is a trivial μ-match if wi + 1 = wj and a nontrivial μ-match if wi + 1 < wj. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2009
ISSN: 1077-8926
DOI: 10.37236/190