Fibonacci Polynomials Research Articles

Solving Neutral Delay Differential Equations Using Galerkin Weighted Residual Method Based on Successive Integration Technique and its Residual Error Correction

Objectives: The main objectives of this work are to solve Neutral Delay Differential Equations (NDDEs) using Galerkin weighted residual method based on successive integration technique and to obtain the Estimation of Error using Residual function. Methods: The Galerkin weighted residual method based on successive integration technique is proposed to obtain approximate solutions of the NDDEs. In this study, the most widely used classical orthogonal polynomials, namely, the Bernoulli polynomials, the Chebyshev polynomials, the Hermite polynomials, and the Fibonacci polynomials are considered. Findings: Numerical examples of linear and nonlinear NDDEs have been considered to demonstrate the efficiency and accuracy of the method. Approximate solutions obtained by the proposed method are well comparable with exact solutions. Novelty: From the results it is observed that the accuracy of the numerical solutions by the proposed method increases as N increases. The proposed method is very effective, simple, and suitable for solving the linear and nonlinear NDDEs in real-world problems. Keywords: Galerkin Weighted Residual method, Polynomials, Hermite, Bernoulli, Chebyshev, Fibonacci, Successive integration technique, Neutral Delay Differential Equations

Coding theory for h(x)-Fibonacci polynomials

The amount of information transmitted over the internet network has dramatically increased with the prevailing of internet use. As a result of this increase, the algorithms used in data encryption methods have gained importance. In this paper, h(x)-Fibonacci coding/decoding method for h(x)-Fibonacci polynomials is introduced. The proposed method is fast because it is based on basic matrix operations, and it is suitable for cryptographic applications because it uses the ASCII character encoding system. For this reason, it differs from the classical algebraic methods in literature. Furthermore, the fact that h(x) is a polynomial improves the security of cryptography.

Some properties of combinatorial triangles related to Horadam polynomials

The Horadam polynomials unify many well-known polynomials, such as the Fibonacci polynomials, the Lucas polynomials, the Pell polynomials, the Jacobsthal polynomials and the Chebyshev polynomials. We investigate some properties of various combinatorial triangles related to Horadam polynomials, including their properties as almost-Riordan arrays and Riordan arrays, their total positivity, the real-rootedness of the generating functions of their rows, and the asymptotic normality (by central and local limit theorems).

Fejér-Quadrature Collocation Algorithm for Solving Fractional Integro-Differential Equations via Fibonacci Polynomials

In this article, we introduce a novel spectral algorithm utilizing Fibonacci polynomials to numerically solve both linear and nonlinear integro-differential equations with fractional-order derivatives. Our approach employs a quadrature-collocation method, transforming complex equations and associated conditions into systems of linear or nonlinear algebraic equations. The solutions to these equations, involving unknown coefficients, provide accurate numerical approximations for the original fractional-order equations. To validate the method, we present numerical examples illustrating its robustness and versatility. Comparative analyses with available analytical solutions affirm the reliability and accuracy of our algorithm, establishing its practical utility in addressing fractional-order integro-differential equations. This research contributes to computational mathematics and spectral methods, offering a promising tool for diverse scientific and engineering challenges.

Some identities of the generalized bi-periodic Fibonacci and Lucas polynomials

<abstract><p>In this paper, we considered the generalized bi-periodic Fibonacci polynomials, and obtained some identities related to generalized bi-periodic Fibonacci polynomials using the matrix theory. In addition, the generalized bi-periodic Lucas polynomial was defined by $ L_{n}\left (x \right) = bp\left (x \right) L_{n-1}\left (x \right)+q\left (x \right)L_{n-2}\left (x \right) $ (if $ n $ is even) or $ L_{n}\left (x \right) = ap\left (x \right) L_{n-1}\left (x \right)+q\left (x \right)L_{n-2}\left (x \right) $ (if $ n $ is odd), with initial conditions $ L_{0}\left (x \right) = 2 $, $ L_{1}\left (x \right) = ap\left (x \right) $, where $ p\left (x \right) $ and $ q\left (x \right) $ were nonzero polynomials in $ Q \left [ x \right ] $. We obtained a series of identities related to the generalized bi-periodic Fibonacci and Lucas polynomials.</p></abstract>

On the power sums problem of bi-periodic Fibonacci and Lucas polynomials

<abstract><p>This paper mainly discussed the power sums of bi-periodic Fibonacci and Lucas polynomials. In addition, we generalized these results to obtain several congruences involving the divisible properties of bi-periodic Fibonacci and Lucas polynomials.</p></abstract>

Some new results for the generalized bivariate Fibonacci and Lucas polynomials

In this paper, new identities are obtained by using the generalized bivariate Fibonacci and Lucas polynomials. Firstly, several binomial summations and the closed formulas for summation of powers are investigated for these polynomials. Also, general summation formulas, different generating functions, and relations of these polynomials are presented.

\(q\)-Analogue of the Generalized Fibonacci and Lucas Polynomials

In this article, we define \(q\)-generalized Fibonacci polynomials and \(q\)-generalized Lucas polynomials using \(q\)-binomial coefficient and obtain their recursive properties. In addition, we introduce generalized \(q\)-Fibonacci matrix and generalized \(q\)-Lucas matrix, then we derive their basic identities. We define \((k,q,t)\)-symmetric generalized Fibonacci matrix and \((k,q,t)\)-symmetric generalized Lucas matrix, then we give the Cholesky factorization of these matrices. Finally, we give determinantal and permanental representations of these new polynomial sequences.

Continued Fraction Expansions Towards Zaremba’s Conjecture

In this article, we show that Zaremba’s conjecture holds for positive integers that appear as values of polynomials resulting from a recurrence formula and their powers of two. For example, Zaremba’s conjecture holds for all positive integers less than or equal to 100 and their powers of two. Also, as a special case, Zaremba’s conjecture holds for positive integers that appear as values of Fibonacci polynomials and powers of two.

On the separation of the roots of the generalized Fibonacci polynomial

In this paper we prove some separation results for the roots of the generalized Fibonacci polynomials and their absolute values.

On the analysis and application of a spectral collocation scheme for the nonlinear two-dimensional fractional diffusion equation

In this paper, we propose and analyze a novel spectral scheme for the numerical solution of a two-dimensional time-fractional diffusion equation. The proposed scheme approximates the unknown function and its derivatives in space by finite Lucas and Fibonacci polynomial expansion, and time derivative/variable by L1 formula with θ-weighted difference scheme. Error estimates are derived and convergence is proved. Six test problems are then solved to verify the theory numerically. The obtained results confirm the low computational cost and better accuracy than known results in the literature.

Hosoya index of thorny polymers

A matching in a graph G is a collection of edges of G such that no two of them share a vertex. The number of all matchings in G is called its Hosoya index. In this paper, we compute Hosoya indices of several classes of unbranched polymers made of cycles of the same lengths arranged around a middle path and decorated by attaching to each vertex, a given number of pendent vertices or thorns. We establish linear recurrences satisfied by those numbers and obtain explicit formulas in terms of Fibonacci polynomials and their generalizations. Some possible directions of future research are also indicated.

Computational analysis of time-fractional models in energy infrastructure applications

In this paper, we propose an effective numerical method to solve the one- and two-dimensional time-fractional convection-diffusion equations based on the Caputo derivative. The presented approach employs a hybrid method that combines Lucas and Fibonacci polynomials with the Caputo derivative definition. The main objective is to transform the problem into a time-discrete form utilizing the Caputo derivative technique and then approximate the function's derivative using Fibonacci polynomials. To evaluate the efficiency and accuracy of the proposed technique, we apply it to one- and two-dimensional problems and compare the results with the exact as well as with existing methods in recent literature. The comparison demonstrates that the proposed approach is highly efficient, accurate and ease to implement.

On symmetric Tetranacci polynomials in mathematics and physics

In this manuscript, we introduce (symmetric) Tetranacci polynomials ξ j as a twofold generalization of ordinary Tetranacci numbers, considering both non unity coefficients and generic initial values. We derive a complete closed form expression for any ξ j with the key feature of a decomposition in terms of generalized Fibonacci polynomials. For suitable conditions, ξ j can be understood as the superposition of standing waves. The issue of Tetranacci polynomials originated from their application in condensed matter physics. We explicitly demonstrate the approach for the spectrum, eigenvectors, Green’s functions and transmission probability for an atomic tight binding chain exhibiting both nearest and next nearest neighbor processes. We demonstrate that in topological trivial models, complex wavevectors can form bulk states as a result of the open boundary conditions. We describe how effective next nearest neighbor bonding is engineered in state of the art theory/experiment exploiting onsite degrees of freedom and close range hopping. We argue about experimental tune ability and on-demand complex wavevectors.

A new hybrid generalization of Fibonacci and Fibonacci-Narayana polynomials

The hybrid numbers are generalization of complex, hyperbolic and dual numbers. The hybrinomials are polynomials which generalize hybrid numbers. In this paper, we introduce and study the distance Fibonacci hybrinomials, i.e. hybrinomials with coefficients being distance Fibonacci polynomials.

A Novel Vieta–Fibonacci Projection Method for Solving a System of Fractional Integrodifferential Equations

In this paper, a new approach for numerically solving the system of fractional integrodifferential equations is devised. To approximate the issue, we employ Vieta–Fibonacci polynomials as basis functions and derive the projection method for Caputo fractional order for the first time. An efficient transformation reduces the problem to a system of two independent equations. Solving two algebraic equations yields an approximate solution to the problem. The proposed method’s efficiency and accuracy are validated. We demonstrate the existence of the solution to the approximate problem and conduct an error analysis. Numerical tests reinforce the interpretations of the theory.

McKay Matrices for Pointed Rank One Hopf Algebras of Nilpotent Type

Let [Formula: see text] be a finite-dimensional pointed rank one Hopf algebra of nilpotent type over a finite group [Formula: see text]. In this paper, we investigate the McKay matrix [Formula: see text] of [Formula: see text] for tensoring with the 2-dimensional indecomposable [Formula: see text]-module [Formula: see text]. It turns out that the characteristic polynomial, eigenvalues and eigenvectors of [Formula: see text] are related to the character table of the finite group [Formula: see text] and a kind of generalized Fibonacci polynomial. Moreover, we construct some eigenvectors of each eigenvalue for [Formula: see text] by using the factorization of the generalized Fibonacci polynomial. As an example, we explicitly compute the characteristic polynomial and eigenvalues of [Formula: see text] and give all eigenvectors of each eigenvalue for [Formula: see text] when [Formula: see text] is a dihedral group of order [Formula: see text].

A new effective coherent numerical technique based on shifted Vieta–Fibonacci polynomials for solving stochastic fractional integro-differential equation

A new effective coherent numerical technique based on shifted Vieta–Fibonacci polynomials for solving stochastic fractional integro-differential equation

Construction of general forms of ordinary generating functions for more families of numbers and multiple variables polynomials

The aim of this paper is to construct general forms of ordinary generating functions for special numbers and polynomials involving Fibonacci type numbers and polynomials, Lucas numbers and polynomials, Chebyshev polynomials, Sextet polynomials, Humbert-type numbers and polynomials, chain and anti-chain polynomials, rank polynomials of the lattices, length of any alphabet of words, partitions, and other graph polynomials. By applying the Euler transform and the Lambert series to these generating functions, many new identities and relations are derived. By using differential equations of these generating functions, some new recurrence relations for these polynomials are found. Moreover, general Binet's type formulas for these polynomials are given. Finally, some new classes of polynomials and their corresponding certain family of special numbers are investigated with the help of these generating functions.

Special transforms of the generalized bivariate Fibonacci and Lucas polynomials

This paper deals with the Catalan, Hankel, binomial transforms of the generalized bivariate Fibonacci and Lucas polynomials. Also, some useful results such as generating functions, Binet formulas, summations of transforms defined by using recurrence relations of these special polynomials are presented. Furthermore, certain important relations among these transforms are deduced by using obtained new formulas. Finally, the Catalan, Cassini, Vajda and d'Ocagne formulas for these transforms are also derived.