Results 81 to 90 of about 466,283 (262)
On the Generalized Class of Multivariable Humbert‐Type Polynomials
The present paper deals with the class of multivariable Humbert polynomials having generalization of some well‐known polynomials like Gegenbauer, Legendre, Chebyshev, Gould, Sinha, Milovanović‐Djordjević, Horadam, Horadam‐Pethe, Pathan and Khan, a class of generalized Humbert polynomials in two variables etc.
B. B. Jaimini +4 more
wiley +1 more source
Some new results for the generalized bivariate Fibonacci and Lucas polynomials [PDF]
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.
Yılmaz Nazmıye
doaj +1 more source
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.
Ö. Kaymak
semanticscholar +1 more source
Narayana Numbers With Zeckendorf Partition in Two Terms
The Narayan’s cow sequence starts with the terms 1, 1, and 1. Each subsequent term is obtained as the sum of the previous term and the term three places before. A term of this sequence is called a Narayana number. The mathematician Zeckendorf proved that every positive integer has a unique decomposition into a sum of distinct and nonconsecutive ...
Japhet Odjoumani +2 more
wiley +1 more source
Incomplete generalized Fibonacci and Lucas polynomials [PDF]
In this paper, we define the incomplete h(x)-Fibonacci and h(x)-Lucas polynomials, we study recurrence relations and some properties of these ...
openaire +3 more sources
The Painlevé equations and their series and rational solutions are essential in applied, pure mathematics and theoretical physics. Recently, quantum algorithms have helped to implement numerical algorithms more easily by performing linear algebra in our working. This article uses a hybrid of quantum computing schemes and spectral methods for the second
Saeid Abbasbandy, Shikha Binwal
wiley +1 more source
This paper is concerned with representing sums of the finite products of Chebyshev polynomials of the second kind and of Fibonacci polynomials in terms of several classical orthogonal polynomials.
Taekyun Kim +3 more
doaj +1 more source
The efficiency of recovery and signal decoding efficacy at the receiver in end‐to‐end communications using linearly predicted coefficients are susceptible to errors, especially for highly compressed signals. In this paper, we propose a method to efficiently recover linearly predicted coefficients for high signal compression for end‐to‐end ...
Abel Kamagara +3 more
wiley +1 more source
Subordination Properties of Bi‐Univalent Functions Involving Horadam Polynomials
In this research, we investigate a family of q‐extensions defined on an open unit disk, which is based on bi‐univalent functions associated with differential subordination. Next, we define certain classes of bi‐univalent functions using generalized Horadam polynomials.
Ebrahim Amini +2 more
wiley +1 more source
Some identities of the generalized bi-periodic Fibonacci and Lucas polynomials
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.
Tingting Du, Zhengang Wu
doaj +1 more source

