Statistics on restricted Fibonacci words

Document Type: Research Paper


Department of Computer Science, University of California Santa Barbara, CA 93106, USA



We study two foremost Mahonian statistics, the major index and the inversion number for a class of binary words called restricted Fibonacci words. The language of restricted Fibonacci words satisfies recurrences which allow for the calculation of the generating functions in two different ways. These yield identities involving the $q$-binomial coefficients and provide non-standard $q$-analogues of the Fibonacci numbers. The major index generating function for restricted Fibonacci words turns out to be a $q$-power multiple of the inversion generating function.


Main Subjects