On the spacings between \(C\)-nomial coefficients (Q1038482): Difference between revisions

Let \(C=(C_n)_{n\geq 0}\) be a sequence of non-zero real numbers. Then for \(1\leq k\leq m-1\) the \(C\)-nomial coefficients are defined as \(\left[\begin{matrix} m\\k\end{matrix}\right]_C=\frac{C_mC_{m-1}\dots C_{m-k+1}}{C_1C_2\dots C_k}\). If \(C\) is a non-degenerate Lucas-sequence then these coefficients are known to be integers. The authors prove that under certain natural conditions the equation \(\left[\begin{matrix} m\\k\end{matrix}\right]_C= \left[\begin{matrix} n\\l\end{matrix}\right]_C\) has no solutions, provided that \(C\) is either the Fibonacci-sequence, or \(C_n=(q^n-1)/(q-1)\) for \(n\geq 0\), where \(q>1\) is a fixed integer. These results are analogous to the classical ones concerning binomial coefficients. Furthermore, it is also proved that if \(C\) is the Fibonacci sequence \(F\), then \(f_{N+1}-f_N\gg (\log f_N)^{1/2}\), where \(f_N\) denotes the \(N\)-th \(F\)-nomial (so-called Fibonomial) coefficient. Here the implied constant is effective.