Related papers: Multivariable Lucas Polynomials and Lucanomials
Lucas atoms are irreducible factors of Lucas polynomials and they were introduced in \cite{ST}. The main aim of the authors was to investigate, from an innovatory point of view, when some combinatorial rational functions are actually…
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…
Using elementary methods, we establish old and new relations between binomial coefficients, Fibonacci numbers, Lucas numbers, and more.
In 1971 Griffiths used a generating function to define polynomials in d variables orthogonal with respect to the multinomial distribution. The polynomials possess a duality between the discrete variables and the degree indices. In 2004…
In 1878 \'E. Lucas proved a remarkable result which provides a simple way to compute the binomial coefficient ${n\choose m}$ modulo a prime $p$ in terms of the binomial coefficients of the base-$p$ digits of $n$ and $m$: {\it If $p$ is a…
In this paper we introduce the generalization of Multi Poly-Euler polynomials and we investigate some relationship involving Multi Poly-Euler polynomials. Obtaining a closed formula for generalization of Multi Poly-Euler numbers therefore…
We evaluate various binomial sums involving the powers of Fibonacci and Lucas numbers.
Binomial coefficients have been used for centuries in a variety of fields and have accumulated numerous definitions. In this paper, we introduce a new way of defining binomial coefficients as repeated sums of ones. A multitude of binomial…
For an integer \( k \geq 2 \), the sequence of \( k \)-generalized Lucas numbers is defined by the recurrence relation \( L_n^{(k)} = L_{n-1}^{(k)} + \cdots + L_{n-k}^{(k)} \) for all \( n \geq 2 \), with initial conditions \( L_0^{(k)} = 2…
A hierarchy of matrix-valued polynomials which generalize the Jacobi polynomials is found. Defined by a Rodrigues formula, they are also products of a sequence of differential operators. Each class of polynomials is complete, satisfies a…
Second-order polynomials generalize classical first-order ones in allowing for additional variables that range over functions rather than values. We are motivated by their applications in higher-order computational complexity theory,…
We establish some new combinatorial identities involving Euler polynomials and balancing (Lucas-balancing) polynomials. The derivations use elementary techniques and are based on functional equations for the respective generating functions.…
We consider a certain left action by the monoid $SL_2(\mathbf{N}_0)$ on the set of divisor pairs $\mathcal{D}_f := \{ (m, n) \in \mathbf{N}_0 \times \mathbf{N}_0 : m \lvert f(n) \}$ where $f \in \mathbf{Z}[x]$ is a polynomial with integer…
Derivative polynomials in two variables are defined by repeated differentiation of the tangent and secant functions. We establish the connections between the coefficients of these derivative polynomials and the numbers of interior and left…
In this article, we survey the the recent literature surrounding the geometry of complex polynomials. Specific areas surveyed are i) Generalizations of the Gauss--Lucas Theorem, ii) Geometry of Polynomials Level Sets, and iii) Shape…
In this work, we made a generalization that includes all bicomplex Fibonacci-like numbers such as; Fibonacci, Lucas, Pell, etc.. We named this generalization as bicomplex Horadam numbers. For bicomplex Fibonacci and Lucas numbers we gave…
We formulate several polynomial identities. One side of these identities has a nice simple form. Whereas the other has a form of a polynomial whose coefficients contain binomial coefficients double factorials or (and) rising factorials. The…
Loop invariants are properties of a program loop that hold both before and after each iteration of the loop. They are often used to verify programs and ensure that algorithms consistently produce correct results during execution.…
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 infinite family of lacunary recurrences for the Lucas numbers using combinatorial means.