Some identities of Gaussian binomial coefficients

In this paper, we present some identities of Gaussian binomial coefficients with respect to recursive sequences, Fibonomial coefficients, and complete functions by use of their relationships.

Divisibility of Fibonomial coefficients in terms of their digital representations and applications

<abstract><p>We give a characterization for the integers $ n \geq 1 $ such that the Fibonomial coefficient $ {pn \choose n}_F $ is divisible by $ p $ for any prime $ p \neq 2, 5 $. Then we use it to calculate asymptotic formulas for the number of positive integers $ n \leq x $ such that $ p \mid {pn \choose n}_F $. This completes the study on this problem for all primes $ p $.</p></abstract>

Q-binomial formulae of Dixon's type and the Fibonomial sums

Cubic sums of the Gaussian q-binomial coefficients with certain weight functions will be evaluated in this paper. To realize this, we will derive two remarkable formulae by means of the Carlitz-Sears transformation on terminating well-poised q-series. As consequences, several summation formulae on Fibonomial coefficients are presented by specializing the value of base q in our q-series identities.

On Fibonomial sums identities with special sign functions: analytically q-calculus approach

Recently Marques and Trojovsky [On some new identities for the Fibonomial coefficients, Math. Slovaca 64 (2014), 809–818] presented interesting two sum identities including the Fibonomial coefficients and Fibonacci numbers. These sums are unusual as they include a rare sign function and their upper bounds are odd. In this paper, we give generalizations of these sums including the Gaussian q-binomial coefficients. We also derive analogue q-binomial sums whose upper bounds are even. Finally we give q-binomial sums formulæ whose weighted functions are different from the earlier ones. To prove the claimed results, we analytically use q-calculus.