相关论文: The logarithmic fibbinomial formula

Our main result is that any real cubic algebraic number has a continued fraction expansion with polynomial coefficients. Some generalizations are mentioned.

In this note, we give an alternate proof of the multinomial theorem using a probabilistic approach. Although the multinomial theorem is basically a combinatorial result, our proof may be simpler for a student familiar with only basic…

We give an overview about well-known basic properties of two classes of q-Fibonacci and q-Lucas polynomials and offer a common generalization.

We prove an inverse relation and a family of convolution formulas involving partial Bell polynomials. Known and some presumably new combinatorial identities of convolution type are discussed. Our approach relies on an interesting…

We prove a closed formula for the derivative, of any order, of a implicit function, in terms of some binomial building blocks, and explain the combinatorics behind the coefficients appearing in the formula.

We define the convolved h(x)-Fibonacci polynomials as an extension of the classical convolved Fibonacci numbers. Then we give some combinatorial formulas involving the h(x)-Fibonacci and h(x)-Lucas polynomials. Moreover we obtain the…

Linear differential equations of arbitrary order with polynomial coefficients are considered. Specifically, necessary and sufficient conditions for the existence of polynomial solutions of a given degree are obtained for these equations. An…

We give a concise direct proof of the orthogonality of interpolation Macdonald polynomials with respect to the Fourier pairing and briefly discuss some immediate applications of this orthogonality, such as the symmetry of the Fourier…

We derive inversion formulas involving orthogonal polynomials which can be used to find coefficients of differential equations satisfied by certain generalizations of the classical orthogonal polynomials. As an example we consider special…

It is shown that some q-analogues of the Fibonacci and Lucas polynomials lead to q-analogues of the Chebyshev polynomials which retain most of their elementary properties.

By polynomial (or extended binomial) coefficients, we mean the coefficients in the expansion of integral powers, positive and negative, of the polynomial $1+t +\cdots +t^{m}$; $m\geq 1$ being a fixed integer. We will establish several…

We give some results and conjectures about recurrence relations for certain sequences of binomial sums.

As is well-known, a generalization of the classical concept of the factorial $n!$ for a real number $x\in {\mathbb R}$ is the value of Euler's gamma function $\Gamma(1+x)$. In this connection, the notion of a binomial coefficient naturally…

We discuss $q$-analogues of the classical congruence $\binom{ap}{bp}\equiv\binom{a}{b}\pmod{p^3}$, valid for primes $p>3$, as well as its generalisations. In particular, we prove related congruences for ($q$-analogues of) integral factorial…

We define an appropriate logarithm function on time scales and present its main properties. This gives answer to a question posed by M. Bohner in [J. Difference Equ. Appl. {\bf 11} (2005), no. 15, 1305--1306].

Recently, Straub gave an interesting $q$-analogue of a binomial congruence of Ljunggren. In this note we give an inductive proof of his result.

In the paper, the authors concisely survey and review some functions involving the gamma function and its various ratios, simply state their logarithmically complete monotonicity and related results, and find necessary and sufficient…

We deliver here H(x)binomials recurrence formula appointed by Ward Horadam sequence of functions which in mostly considered since decades cases where chosen to be polynomials .

New iterative methods for solving linear equations are presented that are easy to use, generalize good existing methods, and appear to be faster. The new algorithms mix two kinds of linear recurrence formulas. Older methods have either high…

We build a variant of Collatz Conjecture for polynomials over $\mathbb{F}_2$ and we prove that it is solved. By the way, we give several examples.